/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:17:08,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:17:08,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:17:08,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:17:08,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:17:08,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:17:08,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:17:08,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:17:08,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:17:08,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:17:08,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:17:08,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:17:08,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:17:08,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:17:08,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:17:08,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:17:08,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:17:08,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:17:08,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:17:08,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:17:08,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:17:09,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:17:09,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:17:09,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:17:09,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:17:09,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:17:09,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:17:09,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:17:09,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:17:09,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:17:09,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:17:09,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:17:09,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:17:09,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:17:09,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:17:09,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:17:09,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:17:09,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:17:09,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:17:09,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:17:09,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:17:09,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:17:09,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:17:09,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:17:09,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:17:09,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:17:09,093 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:17:09,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:17:09,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:17:09,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:17:09,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:17:09,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:17:09,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:17:09,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:17:09,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:17:09,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:17:09,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:17:09,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:17:09,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:17:09,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:17:09,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:17:09,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:17:09,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:17:09,705 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:17:09,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-7.i [2022-12-13 00:17:11,410 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:17:11,972 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:17:11,973 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-7.i [2022-12-13 00:17:11,994 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ba4c1b5/7bdbd6e698d04f67b1dd82704cf5ff42/FLAGb865db402 [2022-12-13 00:17:12,029 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ba4c1b5/7bdbd6e698d04f67b1dd82704cf5ff42 [2022-12-13 00:17:12,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:17:12,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:17:12,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:17:12,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:17:12,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:17:12,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16872cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12, skipping insertion in model container [2022-12-13 00:17:12,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:17:12,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:17:12,644 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-7.i[30241,30254] [2022-12-13 00:17:12,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:17:12,707 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:17:12,771 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-7.i[30241,30254] [2022-12-13 00:17:12,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:17:12,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:17:12,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:17:12,826 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:17:12,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12 WrapperNode [2022-12-13 00:17:12,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:17:12,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:17:12,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:17:12,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:17:12,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,886 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-13 00:17:12,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:17:12,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:17:12,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:17:12,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:17:12,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,955 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:17:12,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:17:12,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:17:12,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:17:12,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (1/1) ... [2022-12-13 00:17:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:17:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:13,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:17:13,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:17:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:17:13,124 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:17:13,124 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:17:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:17:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:17:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:17:13,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:17:13,126 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:17:13,368 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:17:13,369 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:17:13,574 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:17:13,580 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:17:13,581 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 00:17:13,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:17:13 BoogieIcfgContainer [2022-12-13 00:17:13,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:17:13,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:17:13,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:17:13,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:17:13,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:17:12" (1/3) ... [2022-12-13 00:17:13,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@920ce41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:17:13, skipping insertion in model container [2022-12-13 00:17:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:12" (2/3) ... [2022-12-13 00:17:13,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@920ce41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:17:13, skipping insertion in model container [2022-12-13 00:17:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:17:13" (3/3) ... [2022-12-13 00:17:13,607 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-7.i [2022-12-13 00:17:13,657 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:17:13,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:17:13,658 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:17:13,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:17:13,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 00:17:13,944 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 00:17:13,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:13,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 00:17:13,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-13 00:17:13,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:13,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:14,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:14,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:14,083 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-13 00:17:14,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:14,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 00:17:14,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-13 00:17:14,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-13 00:17:19,153 INFO L241 LiptonReduction]: Total number of compositions: 79 [2022-12-13 00:17:19,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:17:19,193 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;@1cfa3d05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:17:19,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 00:17:19,197 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 00:17:19,197 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:19,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:19,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:17:19,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1807783243, now seen corresponding path program 1 times [2022-12-13 00:17:19,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006798651] [2022-12-13 00:17:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:19,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:17:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:19,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006798651] [2022-12-13 00:17:19,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006798651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:19,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:19,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:17:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837367599] [2022-12-13 00:17:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:19,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:17:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:17:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:17:19,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:19,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:19,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:19,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:19,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:19,875 INFO L130 PetriNetUnfolder]: 657/1007 cut-off events. [2022-12-13 00:17:19,875 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 00:17:19,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 1007 events. 657/1007 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4231 event pairs, 175 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 2013. Up to 641 conditions per place. [2022-12-13 00:17:19,889 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 38 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2022-12-13 00:17:19,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 178 flow [2022-12-13 00:17:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:17:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:17:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 00:17:19,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 00:17:19,903 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 55 transitions. [2022-12-13 00:17:19,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 178 flow [2022-12-13 00:17:19,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:17:19,909 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 70 flow [2022-12-13 00:17:19,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-13 00:17:19,914 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 00:17:19,914 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:19,915 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 70 flow [2022-12-13 00:17:19,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:19,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:19,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 70 flow [2022-12-13 00:17:19,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 70 flow [2022-12-13 00:17:19,930 INFO L130 PetriNetUnfolder]: 3/28 cut-off events. [2022-12-13 00:17:19,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 00:17:19,933 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 70 flow [2022-12-13 00:17:19,933 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 00:17:19,935 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:19,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 00:17:19,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 70 flow [2022-12-13 00:17:19,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:19,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:19,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:19,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:17:19,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash 206704716, now seen corresponding path program 1 times [2022-12-13 00:17:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:19,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019688237] [2022-12-13 00:17:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:20,111 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-13 00:17:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019688237] [2022-12-13 00:17:20,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019688237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301303321] [2022-12-13 00:17:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:20,123 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-13 00:17:20,154 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-13 00:17:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:20,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:20,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:20,402 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-13 00:17:20,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:20,443 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-13 00:17:20,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301303321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:20,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:20,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294413742] [2022-12-13 00:17:20,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:20,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:20,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-13 00:17:20,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:20,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:20,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-13 00:17:20,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:20,844 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:20,844 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 00:17:20,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1391 events. 913/1391 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:20,854 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:20,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 95 transitions, 392 flow [2022-12-13 00:17:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:20,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2022-12-13 00:17:20,867 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 70 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:20,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 95 transitions, 392 flow [2022-12-13 00:17:20,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:20,872 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:20,873 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:20,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:20,873 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:20,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:20,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,878 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:20,878 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:20,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:20,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:20,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:21,222 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:21,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-13 00:17:21,224 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:21,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:21,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:21,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:21,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 00:17:21,425 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-13 00:17:21,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 206706204, now seen corresponding path program 1 times [2022-12-13 00:17:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:21,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734814542] [2022-12-13 00:17:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:21,544 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-13 00:17:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734814542] [2022-12-13 00:17:21,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734814542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53348421] [2022-12-13 00:17:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:21,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:21,561 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-13 00:17:21,591 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-13 00:17:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:21,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:21,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:21,688 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-13 00:17:21,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:21,707 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-13 00:17:21,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53348421] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:21,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:21,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913451085] [2022-12-13 00:17:21,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:21,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:21,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:21,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:21,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:21,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:21,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:21,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:21,995 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:21,995 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 00:17:21,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 00:17:22,003 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:22,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:22,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 00:17:22,024 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:22,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:22,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:22,036 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:22,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:22,042 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:22,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:22,042 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:22,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:22,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:22,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:22,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:22,062 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:22,063 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:22,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:22,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:22,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:22,489 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:22,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 449 [2022-12-13 00:17:22,491 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:22,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:22,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:22,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:22,501 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-13 00:17:22,692 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,SelfDestructingSolverStorable2 [2022-12-13 00:17:22,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 206706297, now seen corresponding path program 1 times [2022-12-13 00:17:22,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:22,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504015514] [2022-12-13 00:17:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:22,794 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-13 00:17:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504015514] [2022-12-13 00:17:22,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504015514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511730683] [2022-12-13 00:17:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:22,809 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-13 00:17:22,813 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-13 00:17:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:22,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:22,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:23,013 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-13 00:17:23,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:23,033 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-13 00:17:23,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511730683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:23,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:23,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478345480] [2022-12-13 00:17:23,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:23,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:23,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:23,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:23,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:23,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:23,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:23,382 INFO L130 PetriNetUnfolder]: 913/1391 cut-off events. [2022-12-13 00:17:23,382 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2022-12-13 00:17:23,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1391 events. 913/1391 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5791 event pairs, 175 based on Foata normal form. 192/899 useless extension candidates. Maximal degree in co-relation 3869. Up to 449 conditions per place. [2022-12-13 00:17:23,419 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 86 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 00:17:23,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:17:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:17:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 00:17:23,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 00:17:23,421 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 6 states and 118 transitions. [2022-12-13 00:17:23,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 95 transitions, 414 flow [2022-12-13 00:17:23,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 95 transitions, 390 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:23,427 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:17:23,429 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2022-12-13 00:17:23,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:23,429 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:23,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:23,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,443 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-13 00:17:23,443 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:17:23,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-13 00:17:23,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 104 flow [2022-12-13 00:17:23,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 00:17:23,774 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:23,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347 [2022-12-13 00:17:23,776 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 86 flow [2022-12-13 00:17:23,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:23,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:23,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:23,803 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-13 00:17:23,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:23,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 206706390, now seen corresponding path program 1 times [2022-12-13 00:17:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:23,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371596839] [2022-12-13 00:17:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:24,084 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-13 00:17:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:24,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371596839] [2022-12-13 00:17:24,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371596839] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:24,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407654612] [2022-12-13 00:17:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:24,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:24,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:24,092 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-13 00:17:24,095 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-13 00:17:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:24,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:24,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:24,193 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-13 00:17:24,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:24,208 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-13 00:17:24,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407654612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:24,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:24,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624183409] [2022-12-13 00:17:24,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:24,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:24,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:24,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:24,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:24,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:24,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:24,457 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:24,457 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2022-12-13 00:17:24,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1199 events. 785/1199 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3357. Up to 449 conditions per place. [2022-12-13 00:17:24,475 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:24,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 78 transitions, 342 flow [2022-12-13 00:17:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:24,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:24,488 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 86 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:24,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 78 transitions, 342 flow [2022-12-13 00:17:24,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 00:17:24,493 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:24,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:24,495 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:24,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:24,496 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:24,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:24,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:24,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:24,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:24,515 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:24,515 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:24,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:24,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:24,728 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:24,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-13 00:17:24,729 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:24,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:24,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:24,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:24,742 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-13 00:17:24,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:24,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 206706452, now seen corresponding path program 1 times [2022-12-13 00:17:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:24,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130567787] [2022-12-13 00:17:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:24,989 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-13 00:17:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:24,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130567787] [2022-12-13 00:17:24,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130567787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:24,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316326513] [2022-12-13 00:17:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:24,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:24,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:25,009 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-13 00:17:25,052 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-13 00:17:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:25,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:25,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:25,140 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-13 00:17:25,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:25,155 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-13 00:17:25,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316326513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:25,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:25,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530085135] [2022-12-13 00:17:25,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:25,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:25,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:25,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:25,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:25,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:25,346 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:25,346 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 00:17:25,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:25,364 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:25,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:25,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:25,382 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:25,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:25,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:25,385 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:25,386 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:25,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:25,386 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:25,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:25,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,390 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:25,390 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:25,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:25,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:25,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:25,606 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:25,607 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-13 00:17:25,607 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:25,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:25,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:25,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:25,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 00:17:25,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:25,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 206706514, now seen corresponding path program 1 times [2022-12-13 00:17:25,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:25,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679277160] [2022-12-13 00:17:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:25,890 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-13 00:17:25,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:25,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679277160] [2022-12-13 00:17:25,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679277160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:25,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81060444] [2022-12-13 00:17:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:25,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:25,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:25,907 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-13 00:17:25,936 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-13 00:17:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:26,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:17:26,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:26,012 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-13 00:17:26,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:26,024 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-13 00:17:26,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81060444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:26,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:26,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 00:17:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303169169] [2022-12-13 00:17:26,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:26,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:26,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:26,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:26,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:26,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:26,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:26,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:26,200 INFO L130 PetriNetUnfolder]: 785/1199 cut-off events. [2022-12-13 00:17:26,200 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 00:17:26,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 1199 events. 785/1199 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4960 event pairs, 175 based on Foata normal form. 128/739 useless extension candidates. Maximal degree in co-relation 3229. Up to 449 conditions per place. [2022-12-13 00:17:26,207 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2022-12-13 00:17:26,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:17:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:17:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:17:26,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:17:26,209 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:17:26,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-12-13 00:17:26,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 320 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:26,212 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 00:17:26,213 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-13 00:17:26,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:26,213 INFO L89 Accepts]: Start accepts. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:26,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:26,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,218 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-13 00:17:26,218 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:17:26,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 74 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 00:17:26,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 94 flow [2022-12-13 00:17:26,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 00:17:26,376 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:26,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 00:17:26,377 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 82 flow [2022-12-13 00:17:26,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:26,378 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:26,378 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:26,387 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-13 00:17:26,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:26,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash 206706576, now seen corresponding path program 1 times [2022-12-13 00:17:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:26,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275508565] [2022-12-13 00:17:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:26,714 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-13 00:17:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275508565] [2022-12-13 00:17:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275508565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22951146] [2022-12-13 00:17:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:26,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:26,717 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-13 00:17:26,719 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-13 00:17:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:26,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 00:17:26,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:26,849 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-13 00:17:26,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:27,094 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-13 00:17:27,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22951146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:27,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:27,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-13 00:17:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877616317] [2022-12-13 00:17:27,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:27,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:17:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:17:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:17:27,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:17:27,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 82 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:27,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:27,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:17:27,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:28,316 INFO L130 PetriNetUnfolder]: 1625/2406 cut-off events. [2022-12-13 00:17:28,316 INFO L131 PetriNetUnfolder]: For 2392/2392 co-relation queries the response was YES. [2022-12-13 00:17:28,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 2406 events. 1625/2406 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 11413 event pairs, 111 based on Foata normal form. 158/1328 useless extension candidates. Maximal degree in co-relation 6249. Up to 1339 conditions per place. [2022-12-13 00:17:28,332 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 79 selfloop transitions, 55 changer transitions 0/138 dead transitions. [2022-12-13 00:17:28,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 138 transitions, 616 flow [2022-12-13 00:17:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:17:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:17:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 00:17:28,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-12-13 00:17:28,334 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 82 flow. Second operand 8 states and 170 transitions. [2022-12-13 00:17:28,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 138 transitions, 616 flow [2022-12-13 00:17:28,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 138 transitions, 576 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-13 00:17:28,340 INFO L231 Difference]: Finished difference. Result has 42 places, 83 transitions, 378 flow [2022-12-13 00:17:28,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=42, PETRI_TRANSITIONS=83} [2022-12-13 00:17:28,342 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-13 00:17:28,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:28,342 INFO L89 Accepts]: Start accepts. Operand has 42 places, 83 transitions, 378 flow [2022-12-13 00:17:28,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:28,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:28,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 83 transitions, 378 flow [2022-12-13 00:17:28,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 83 transitions, 378 flow [2022-12-13 00:17:28,372 INFO L130 PetriNetUnfolder]: 329/532 cut-off events. [2022-12-13 00:17:28,373 INFO L131 PetriNetUnfolder]: For 410/410 co-relation queries the response was YES. [2022-12-13 00:17:28,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 532 events. 329/532 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2325 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 1299. Up to 377 conditions per place. [2022-12-13 00:17:28,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 83 transitions, 378 flow [2022-12-13 00:17:28,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 1160 [2022-12-13 00:17:28,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:17:28,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:28,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:17:28,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:28,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:17:28,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:28,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:28,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:28,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:28,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:17:29,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:29,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:17:29,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:17:29,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:17:29,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:29,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:17:29,421 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:29,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1080 [2022-12-13 00:17:29,427 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 82 transitions, 453 flow [2022-12-13 00:17:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:29,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:29,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:29,437 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-13 00:17:29,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:29,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1348832159, now seen corresponding path program 1 times [2022-12-13 00:17:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:29,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967131448] [2022-12-13 00:17:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:29,671 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-13 00:17:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:29,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967131448] [2022-12-13 00:17:29,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967131448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:29,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:29,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:17:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243904255] [2022-12-13 00:17:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:29,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:17:29,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:17:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:17:29,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 46 [2022-12-13 00:17:29,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 82 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:29,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:29,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 46 [2022-12-13 00:17:29,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:29,822 INFO L130 PetriNetUnfolder]: 1152/1728 cut-off events. [2022-12-13 00:17:29,822 INFO L131 PetriNetUnfolder]: For 1425/1425 co-relation queries the response was YES. [2022-12-13 00:17:29,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1728 events. 1152/1728 cut-off events. For 1425/1425 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 8066 event pairs, 378 based on Foata normal form. 79/1019 useless extension candidates. Maximal degree in co-relation 5253. Up to 890 conditions per place. [2022-12-13 00:17:29,834 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 63 selfloop transitions, 18 changer transitions 1/86 dead transitions. [2022-12-13 00:17:29,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 86 transitions, 596 flow [2022-12-13 00:17:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:17:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:17:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 00:17:29,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-13 00:17:29,835 INFO L175 Difference]: Start difference. First operand has 41 places, 82 transitions, 453 flow. Second operand 3 states and 70 transitions. [2022-12-13 00:17:29,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 86 transitions, 596 flow [2022-12-13 00:17:29,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 86 transitions, 556 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-13 00:17:29,848 INFO L231 Difference]: Finished difference. Result has 40 places, 69 transitions, 373 flow [2022-12-13 00:17:29,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=40, PETRI_TRANSITIONS=69} [2022-12-13 00:17:29,849 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2022-12-13 00:17:29,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:29,849 INFO L89 Accepts]: Start accepts. Operand has 40 places, 69 transitions, 373 flow [2022-12-13 00:17:29,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:29,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:29,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 69 transitions, 373 flow [2022-12-13 00:17:29,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 69 transitions, 373 flow [2022-12-13 00:17:29,871 INFO L130 PetriNetUnfolder]: 272/441 cut-off events. [2022-12-13 00:17:29,871 INFO L131 PetriNetUnfolder]: For 173/181 co-relation queries the response was YES. [2022-12-13 00:17:29,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 441 events. 272/441 cut-off events. For 173/181 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1781 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1105. Up to 321 conditions per place. [2022-12-13 00:17:29,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 69 transitions, 373 flow [2022-12-13 00:17:29,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 00:17:29,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:29,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:17:29,877 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 69 transitions, 373 flow [2022-12-13 00:17:29,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:29,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:29,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:29,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:17:29,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:17:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1349048260, now seen corresponding path program 1 times [2022-12-13 00:17:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:29,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941630299] [2022-12-13 00:17:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:30,025 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-13 00:17:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941630299] [2022-12-13 00:17:30,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941630299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:17:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64956072] [2022-12-13 00:17:30,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:30,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:30,028 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-13 00:17:30,053 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-13 00:17:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:30,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 00:17:30,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:17:30,172 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-13 00:17:30,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:17:30,428 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-13 00:17:30,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64956072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:17:30,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:17:30,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 00:17:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235392627] [2022-12-13 00:17:30,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:17:30,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 00:17:30,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:30,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 00:17:30,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 00:17:30,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 00:17:30,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 69 transitions, 373 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:30,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:30,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 00:17:30,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:34,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:36,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:39,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:40,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:43,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:46,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:48,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:50,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:52,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:54,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:56,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:17:58,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:00,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:01,956 INFO L130 PetriNetUnfolder]: 2780/4191 cut-off events. [2022-12-13 00:18:01,956 INFO L131 PetriNetUnfolder]: For 3076/3076 co-relation queries the response was YES. [2022-12-13 00:18:01,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12383 conditions, 4191 events. 2780/4191 cut-off events. For 3076/3076 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 23532 event pairs, 100 based on Foata normal form. 168/2447 useless extension candidates. Maximal degree in co-relation 12367. Up to 2080 conditions per place. [2022-12-13 00:18:01,987 INFO L137 encePairwiseOnDemand]: 16/44 looper letters, 110 selfloop transitions, 131 changer transitions 0/245 dead transitions. [2022-12-13 00:18:01,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 245 transitions, 1490 flow [2022-12-13 00:18:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 00:18:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 00:18:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2022-12-13 00:18:01,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 00:18:01,990 INFO L175 Difference]: Start difference. First operand has 39 places, 69 transitions, 373 flow. Second operand 12 states and 276 transitions. [2022-12-13 00:18:01,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 245 transitions, 1490 flow [2022-12-13 00:18:02,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 245 transitions, 1426 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 00:18:02,018 INFO L231 Difference]: Finished difference. Result has 51 places, 159 transitions, 1121 flow [2022-12-13 00:18:02,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1121, PETRI_PLACES=51, PETRI_TRANSITIONS=159} [2022-12-13 00:18:02,020 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-12-13 00:18:02,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:02,020 INFO L89 Accepts]: Start accepts. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 00:18:02,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:02,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:02,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 00:18:02,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 159 transitions, 1121 flow [2022-12-13 00:18:02,075 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-13 00:18:02,075 INFO L131 PetriNetUnfolder]: For 686/741 co-relation queries the response was YES. [2022-12-13 00:18:02,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 1017 events. 604/1017 cut-off events. For 686/741 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 5498 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 3341. Up to 777 conditions per place. [2022-12-13 00:18:02,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 159 transitions, 1121 flow [2022-12-13 00:18:02,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-13 00:18:02,086 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:02,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 00:18:02,089 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 159 transitions, 1121 flow [2022-12-13 00:18:02,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:02,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:02,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:02,096 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-13 00:18:02,295 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,SelfDestructingSolverStorable9 [2022-12-13 00:18:02,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:18:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1348900855, now seen corresponding path program 1 times [2022-12-13 00:18:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:02,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108412512] [2022-12-13 00:18:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:18:02,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:02,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108412512] [2022-12-13 00:18:02,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108412512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:18:02,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406783675] [2022-12-13 00:18:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:02,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:02,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:18:02,344 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-13 00:18:02,346 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-13 00:18:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:02,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:18:02,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:18:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:18:02,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:18:02,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406783675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:02,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 00:18:02,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 00:18:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634215755] [2022-12-13 00:18:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:02,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:18:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:18:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:18:02,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-13 00:18:02,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 159 transitions, 1121 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:02,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:02,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-13 00:18:02,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:02,702 INFO L130 PetriNetUnfolder]: 1996/3185 cut-off events. [2022-12-13 00:18:02,702 INFO L131 PetriNetUnfolder]: For 3541/3541 co-relation queries the response was YES. [2022-12-13 00:18:02,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10872 conditions, 3185 events. 1996/3185 cut-off events. For 3541/3541 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 18975 event pairs, 727 based on Foata normal form. 350/1903 useless extension candidates. Maximal degree in co-relation 10853. Up to 1634 conditions per place. [2022-12-13 00:18:02,716 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 133 selfloop transitions, 28 changer transitions 0/165 dead transitions. [2022-12-13 00:18:02,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 165 transitions, 1428 flow [2022-12-13 00:18:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:18:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:18:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 00:18:02,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 00:18:02,718 INFO L175 Difference]: Start difference. First operand has 51 places, 159 transitions, 1121 flow. Second operand 4 states and 72 transitions. [2022-12-13 00:18:02,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 165 transitions, 1428 flow [2022-12-13 00:18:02,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 165 transitions, 1295 flow, removed 58 selfloop flow, removed 1 redundant places. [2022-12-13 00:18:02,756 INFO L231 Difference]: Finished difference. Result has 52 places, 141 transitions, 949 flow [2022-12-13 00:18:02,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=949, PETRI_PLACES=52, PETRI_TRANSITIONS=141} [2022-12-13 00:18:02,757 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 00:18:02,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:02,757 INFO L89 Accepts]: Start accepts. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 00:18:02,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:02,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:02,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 00:18:02,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 141 transitions, 949 flow [2022-12-13 00:18:02,797 INFO L130 PetriNetUnfolder]: 424/781 cut-off events. [2022-12-13 00:18:02,797 INFO L131 PetriNetUnfolder]: For 747/782 co-relation queries the response was YES. [2022-12-13 00:18:02,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 781 events. 424/781 cut-off events. For 747/782 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4539 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 2281. Up to 405 conditions per place. [2022-12-13 00:18:02,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 141 transitions, 949 flow [2022-12-13 00:18:02,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 1632 [2022-12-13 00:18:02,805 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:02,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 00:18:02,806 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 141 transitions, 949 flow [2022-12-13 00:18:02,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:02,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:02,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:02,816 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-13 00:18:03,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:03,016 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:18:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1025623679, now seen corresponding path program 1 times [2022-12-13 00:18:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:03,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834595151] [2022-12-13 00:18:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:03,160 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-13 00:18:03,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834595151] [2022-12-13 00:18:03,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834595151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:18:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786878125] [2022-12-13 00:18:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:18:03,162 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-13 00:18:03,164 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-13 00:18:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:03,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 00:18:03,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:18:03,309 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-13 00:18:03,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:18:03,555 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-13 00:18:03,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786878125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:18:03,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:18:03,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 00:18:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521641973] [2022-12-13 00:18:03,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:18:03,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 00:18:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 00:18:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 00:18:03,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:18:03,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 141 transitions, 949 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:03,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:03,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:18:03,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:06,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:08,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:10,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:12,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:13,547 INFO L130 PetriNetUnfolder]: 3207/5195 cut-off events. [2022-12-13 00:18:13,548 INFO L131 PetriNetUnfolder]: For 7682/7682 co-relation queries the response was YES. [2022-12-13 00:18:13,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 5195 events. 3207/5195 cut-off events. For 7682/7682 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 34477 event pairs, 229 based on Foata normal form. 168/2671 useless extension candidates. Maximal degree in co-relation 16240. Up to 2896 conditions per place. [2022-12-13 00:18:13,572 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 137 selfloop transitions, 157 changer transitions 0/298 dead transitions. [2022-12-13 00:18:13,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 298 transitions, 2101 flow [2022-12-13 00:18:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:18:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:18:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-13 00:18:13,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2022-12-13 00:18:13,575 INFO L175 Difference]: Start difference. First operand has 52 places, 141 transitions, 949 flow. Second operand 11 states and 242 transitions. [2022-12-13 00:18:13,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 298 transitions, 2101 flow [2022-12-13 00:18:13,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 298 transitions, 2068 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:18:13,633 INFO L231 Difference]: Finished difference. Result has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:13,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1894, PETRI_PLACES=66, PETRI_TRANSITIONS=225} [2022-12-13 00:18:13,634 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-12-13 00:18:13,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:13,634 INFO L89 Accepts]: Start accepts. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:13,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:13,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:13,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:13,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:13,687 INFO L130 PetriNetUnfolder]: 640/1265 cut-off events. [2022-12-13 00:18:13,687 INFO L131 PetriNetUnfolder]: For 2464/2535 co-relation queries the response was YES. [2022-12-13 00:18:13,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1265 events. 640/1265 cut-off events. For 2464/2535 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 8896 event pairs, 0 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 4977. Up to 733 conditions per place. [2022-12-13 00:18:13,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:13,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-13 00:18:13,700 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:13,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 00:18:13,700 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 225 transitions, 1894 flow [2022-12-13 00:18:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:13,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:13,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:13,709 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-13 00:18:13,906 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,SelfDestructingSolverStorable11 [2022-12-13 00:18:13,907 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:18:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1134621035, now seen corresponding path program 1 times [2022-12-13 00:18:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:13,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478560592] [2022-12-13 00:18:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:14,204 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-13 00:18:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478560592] [2022-12-13 00:18:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478560592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:18:14,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773674439] [2022-12-13 00:18:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:14,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:18:14,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:18:14,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 00:18:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:14,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 00:18:14,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:18:14,366 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-13 00:18:14,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:18:14,682 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-13 00:18:14,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773674439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:18:14,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:18:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 00:18:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078907706] [2022-12-13 00:18:14,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:18:14,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:18:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:18:14,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:18:14,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:18:14,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 225 transitions, 1894 flow. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:14,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:14,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:18:14,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:17,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:19,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:21,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:23,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:25,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:29,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:30,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:32,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:37,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:39,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:41,441 INFO L130 PetriNetUnfolder]: 4901/7979 cut-off events. [2022-12-13 00:18:41,442 INFO L131 PetriNetUnfolder]: For 25009/25009 co-relation queries the response was YES. [2022-12-13 00:18:41,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31147 conditions, 7979 events. 4901/7979 cut-off events. For 25009/25009 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 57233 event pairs, 202 based on Foata normal form. 154/4046 useless extension candidates. Maximal degree in co-relation 31121. Up to 3237 conditions per place. [2022-12-13 00:18:41,477 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 146 selfloop transitions, 251 changer transitions 0/401 dead transitions. [2022-12-13 00:18:41,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 401 transitions, 3468 flow [2022-12-13 00:18:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 00:18:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 00:18:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2022-12-13 00:18:41,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368217054263565 [2022-12-13 00:18:41,479 INFO L175 Difference]: Start difference. First operand has 66 places, 225 transitions, 1894 flow. Second operand 12 states and 277 transitions. [2022-12-13 00:18:41,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 401 transitions, 3468 flow [2022-12-13 00:18:41,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 401 transitions, 3289 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-13 00:18:41,693 INFO L231 Difference]: Finished difference. Result has 78 places, 306 transitions, 3053 flow [2022-12-13 00:18:41,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3053, PETRI_PLACES=78, PETRI_TRANSITIONS=306} [2022-12-13 00:18:41,694 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 00:18:41,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:41,694 INFO L89 Accepts]: Start accepts. Operand has 78 places, 306 transitions, 3053 flow [2022-12-13 00:18:41,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:41,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:41,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 306 transitions, 3053 flow [2022-12-13 00:18:41,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 306 transitions, 3053 flow [2022-12-13 00:18:41,818 INFO L130 PetriNetUnfolder]: 968/1965 cut-off events. [2022-12-13 00:18:41,818 INFO L131 PetriNetUnfolder]: For 7560/7631 co-relation queries the response was YES. [2022-12-13 00:18:41,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9473 conditions, 1965 events. 968/1965 cut-off events. For 7560/7631 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 15401 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 9445. Up to 1165 conditions per place. [2022-12-13 00:18:41,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 306 transitions, 3053 flow [2022-12-13 00:18:41,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 3424 [2022-12-13 00:18:41,832 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:41,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 00:18:41,833 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 306 transitions, 3053 flow [2022-12-13 00:18:41,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:41,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:41,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:41,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 00:18:42,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 00:18:42,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:18:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1931260224, now seen corresponding path program 1 times [2022-12-13 00:18:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:42,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667269143] [2022-12-13 00:18:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:42,275 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-13 00:18:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:42,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667269143] [2022-12-13 00:18:42,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667269143] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:18:42,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808786542] [2022-12-13 00:18:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:42,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:18:42,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:18:42,284 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:18:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 00:18:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:42,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:18:42,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:18:42,536 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-13 00:18:42,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:18:42,923 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-13 00:18:42,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808786542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:18:42,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:18:42,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 00:18:42,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803958817] [2022-12-13 00:18:42,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:18:42,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:18:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:42,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:18:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:18:42,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:18:42,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 306 transitions, 3053 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:42,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:42,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:18:42,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:51,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:53,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:55,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:18:57,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:00,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:02,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:04,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:06,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:09,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:13,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:16,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:18,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:20,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:22,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:24,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:26,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:28,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:30,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:32,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:34,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:36,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:38,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:40,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:41,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:42,498 INFO L130 PetriNetUnfolder]: 4964/8214 cut-off events. [2022-12-13 00:19:42,498 INFO L131 PetriNetUnfolder]: For 48014/48014 co-relation queries the response was YES. [2022-12-13 00:19:42,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36301 conditions, 8214 events. 4964/8214 cut-off events. For 48014/48014 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 59952 event pairs, 259 based on Foata normal form. 301/4230 useless extension candidates. Maximal degree in co-relation 36270. Up to 4886 conditions per place. [2022-12-13 00:19:42,532 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 224 selfloop transitions, 238 changer transitions 0/466 dead transitions. [2022-12-13 00:19:42,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 466 transitions, 4665 flow [2022-12-13 00:19:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 00:19:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 00:19:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 320 transitions. [2022-12-13 00:19:42,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2022-12-13 00:19:42,534 INFO L175 Difference]: Start difference. First operand has 78 places, 306 transitions, 3053 flow. Second operand 15 states and 320 transitions. [2022-12-13 00:19:42,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 466 transitions, 4665 flow [2022-12-13 00:19:43,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 466 transitions, 4254 flow, removed 89 selfloop flow, removed 8 redundant places. [2022-12-13 00:19:43,303 INFO L231 Difference]: Finished difference. Result has 87 places, 362 transitions, 3852 flow [2022-12-13 00:19:43,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2698, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3852, PETRI_PLACES=87, PETRI_TRANSITIONS=362} [2022-12-13 00:19:43,304 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2022-12-13 00:19:43,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:19:43,304 INFO L89 Accepts]: Start accepts. Operand has 87 places, 362 transitions, 3852 flow [2022-12-13 00:19:43,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:19:43,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:19:43,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 362 transitions, 3852 flow [2022-12-13 00:19:43,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 362 transitions, 3852 flow [2022-12-13 00:19:43,421 INFO L130 PetriNetUnfolder]: 1188/2301 cut-off events. [2022-12-13 00:19:43,421 INFO L131 PetriNetUnfolder]: For 6931/7002 co-relation queries the response was YES. [2022-12-13 00:19:43,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11176 conditions, 2301 events. 1188/2301 cut-off events. For 6931/7002 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 17293 event pairs, 0 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 11149. Up to 1361 conditions per place. [2022-12-13 00:19:43,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 362 transitions, 3852 flow [2022-12-13 00:19:43,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 3840 [2022-12-13 00:19:43,435 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:19:43,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 00:19:43,436 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 362 transitions, 3852 flow [2022-12-13 00:19:43,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:19:43,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:19:43,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:19:43,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 00:19:43,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 00:19:43,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:19:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:19:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1930067096, now seen corresponding path program 1 times [2022-12-13 00:19:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:19:43,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542286132] [2022-12-13 00:19:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:19:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:19:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:19:43,825 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-13 00:19:43,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:19:43,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542286132] [2022-12-13 00:19:43,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542286132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:19:43,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959470295] [2022-12-13 00:19:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:19:43,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:19:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:19:43,827 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:19:43,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 00:19:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:19:43,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:19:43,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:19:44,033 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-13 00:19:44,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:19:44,328 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-13 00:19:44,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959470295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:19:44,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:19:44,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 00:19:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103964859] [2022-12-13 00:19:44,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:19:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 00:19:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:19:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 00:19:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 00:19:44,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:19:44,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 362 transitions, 3852 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:19:44,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:19:44,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:19:44,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:19:50,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:53,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:55,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:19:57,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:07,209 WARN L233 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:20:09,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:11,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:13,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:14,732 INFO L130 PetriNetUnfolder]: 5573/9518 cut-off events. [2022-12-13 00:20:14,733 INFO L131 PetriNetUnfolder]: For 38207/38207 co-relation queries the response was YES. [2022-12-13 00:20:14,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42711 conditions, 9518 events. 5573/9518 cut-off events. For 38207/38207 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 74852 event pairs, 331 based on Foata normal form. 196/4534 useless extension candidates. Maximal degree in co-relation 42681. Up to 5344 conditions per place. [2022-12-13 00:20:14,782 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 254 selfloop transitions, 327 changer transitions 3/588 dead transitions. [2022-12-13 00:20:14,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 588 transitions, 6516 flow [2022-12-13 00:20:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 00:20:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 00:20:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 335 transitions. [2022-12-13 00:20:14,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48691860465116277 [2022-12-13 00:20:14,785 INFO L175 Difference]: Start difference. First operand has 87 places, 362 transitions, 3852 flow. Second operand 16 states and 335 transitions. [2022-12-13 00:20:14,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 588 transitions, 6516 flow [2022-12-13 00:20:15,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 588 transitions, 6166 flow, removed 48 selfloop flow, removed 8 redundant places. [2022-12-13 00:20:15,539 INFO L231 Difference]: Finished difference. Result has 99 places, 479 transitions, 5825 flow [2022-12-13 00:20:15,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3578, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5825, PETRI_PLACES=99, PETRI_TRANSITIONS=479} [2022-12-13 00:20:15,540 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2022-12-13 00:20:15,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:20:15,540 INFO L89 Accepts]: Start accepts. Operand has 99 places, 479 transitions, 5825 flow [2022-12-13 00:20:15,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:20:15,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:20:15,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 479 transitions, 5825 flow [2022-12-13 00:20:15,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 479 transitions, 5825 flow [2022-12-13 00:20:15,713 INFO L130 PetriNetUnfolder]: 1428/2898 cut-off events. [2022-12-13 00:20:15,713 INFO L131 PetriNetUnfolder]: For 10593/10664 co-relation queries the response was YES. [2022-12-13 00:20:15,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15741 conditions, 2898 events. 1428/2898 cut-off events. For 10593/10664 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 24007 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 15708. Up to 1733 conditions per place. [2022-12-13 00:20:15,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 479 transitions, 5825 flow [2022-12-13 00:20:15,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 4832 [2022-12-13 00:20:15,731 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:20:15,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-13 00:20:15,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 479 transitions, 5825 flow [2022-12-13 00:20:15,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:20:15,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:20:15,732 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:20:15,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 00:20:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 00:20:15,933 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:20:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:20:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2075009868, now seen corresponding path program 1 times [2022-12-13 00:20:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:20:15,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124214384] [2022-12-13 00:20:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:20:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:20:16,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:20:16,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124214384] [2022-12-13 00:20:16,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124214384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:20:16,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589337598] [2022-12-13 00:20:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:16,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:20:16,222 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:20:16,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 00:20:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:16,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:20:16,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:20:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:20:16,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:20:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:20:17,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589337598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:20:17,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:20:17,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:20:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548887291] [2022-12-13 00:20:17,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:20:17,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:20:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:20:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:20:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:20:17,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:20:17,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 479 transitions, 5825 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:20:17,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:20:17,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:20:17,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:20:20,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:23,144 INFO L130 PetriNetUnfolder]: 7876/13421 cut-off events. [2022-12-13 00:20:23,145 INFO L131 PetriNetUnfolder]: For 79617/79617 co-relation queries the response was YES. [2022-12-13 00:20:23,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67146 conditions, 13421 events. 7876/13421 cut-off events. For 79617/79617 co-relation queries the response was YES. Maximal size of possible extension queue 1622. Compared 110774 event pairs, 391 based on Foata normal form. 147/6376 useless extension candidates. Maximal degree in co-relation 67110. Up to 5470 conditions per place. [2022-12-13 00:20:23,244 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 299 selfloop transitions, 423 changer transitions 0/726 dead transitions. [2022-12-13 00:20:23,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 726 transitions, 9169 flow [2022-12-13 00:20:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 00:20:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 00:20:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 333 transitions. [2022-12-13 00:20:23,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5162790697674419 [2022-12-13 00:20:23,248 INFO L175 Difference]: Start difference. First operand has 99 places, 479 transitions, 5825 flow. Second operand 15 states and 333 transitions. [2022-12-13 00:20:23,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 726 transitions, 9169 flow [2022-12-13 00:20:24,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 726 transitions, 8753 flow, removed 80 selfloop flow, removed 8 redundant places. [2022-12-13 00:20:24,910 INFO L231 Difference]: Finished difference. Result has 109 places, 613 transitions, 8304 flow [2022-12-13 00:20:24,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5441, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8304, PETRI_PLACES=109, PETRI_TRANSITIONS=613} [2022-12-13 00:20:24,912 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2022-12-13 00:20:24,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:20:24,912 INFO L89 Accepts]: Start accepts. Operand has 109 places, 613 transitions, 8304 flow [2022-12-13 00:20:24,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:20:24,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:20:24,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 613 transitions, 8304 flow [2022-12-13 00:20:24,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 613 transitions, 8304 flow [2022-12-13 00:20:25,292 INFO L130 PetriNetUnfolder]: 2128/4246 cut-off events. [2022-12-13 00:20:25,292 INFO L131 PetriNetUnfolder]: For 25715/25795 co-relation queries the response was YES. [2022-12-13 00:20:25,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26567 conditions, 4246 events. 2128/4246 cut-off events. For 25715/25795 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 36373 event pairs, 24 based on Foata normal form. 0/1362 useless extension candidates. Maximal degree in co-relation 26529. Up to 2565 conditions per place. [2022-12-13 00:20:25,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 613 transitions, 8304 flow [2022-12-13 00:20:25,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 6176 [2022-12-13 00:20:25,342 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:20:25,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 430 [2022-12-13 00:20:25,342 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 613 transitions, 8304 flow [2022-12-13 00:20:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:20:25,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:20:25,343 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:20:25,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 00:20:25,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:25,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:20:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:20:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash -262192484, now seen corresponding path program 1 times [2022-12-13 00:20:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:20:25,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156776720] [2022-12-13 00:20:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:20:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:25,761 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-13 00:20:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:20:25,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156776720] [2022-12-13 00:20:25,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156776720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:20:25,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079020911] [2022-12-13 00:20:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:25,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:20:25,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:20:25,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 00:20:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:25,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:20:25,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:20:26,029 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-13 00:20:26,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:20:26,483 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-13 00:20:26,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079020911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:20:26,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:20:26,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:20:26,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458648911] [2022-12-13 00:20:26,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:20:26,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:20:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:20:26,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:20:26,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:20:26,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:20:26,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 613 transitions, 8304 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:20:26,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:20:26,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:20:26,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:20:33,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:37,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:39,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:42,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:44,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:20:47,139 INFO L130 PetriNetUnfolder]: 11187/19296 cut-off events. [2022-12-13 00:20:47,139 INFO L131 PetriNetUnfolder]: For 197416/197416 co-relation queries the response was YES. [2022-12-13 00:20:47,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107791 conditions, 19296 events. 11187/19296 cut-off events. For 197416/197416 co-relation queries the response was YES. Maximal size of possible extension queue 2332. Compared 169247 event pairs, 444 based on Foata normal form. 350/9139 useless extension candidates. Maximal degree in co-relation 107750. Up to 8027 conditions per place. [2022-12-13 00:20:47,228 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 287 selfloop transitions, 757 changer transitions 0/1048 dead transitions. [2022-12-13 00:20:47,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 1048 transitions, 14373 flow [2022-12-13 00:20:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 00:20:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 00:20:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 502 transitions. [2022-12-13 00:20:47,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48643410852713176 [2022-12-13 00:20:47,230 INFO L175 Difference]: Start difference. First operand has 109 places, 613 transitions, 8304 flow. Second operand 24 states and 502 transitions. [2022-12-13 00:20:47,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 1048 transitions, 14373 flow [2022-12-13 00:20:49,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1048 transitions, 13753 flow, removed 232 selfloop flow, removed 6 redundant places. [2022-12-13 00:20:49,903 INFO L231 Difference]: Finished difference. Result has 136 places, 877 transitions, 13872 flow [2022-12-13 00:20:49,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7808, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=13872, PETRI_PLACES=136, PETRI_TRANSITIONS=877} [2022-12-13 00:20:49,904 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2022-12-13 00:20:49,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:20:49,904 INFO L89 Accepts]: Start accepts. Operand has 136 places, 877 transitions, 13872 flow [2022-12-13 00:20:49,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:20:49,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:20:49,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 877 transitions, 13872 flow [2022-12-13 00:20:49,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 877 transitions, 13872 flow [2022-12-13 00:20:50,452 INFO L130 PetriNetUnfolder]: 2912/6134 cut-off events. [2022-12-13 00:20:50,452 INFO L131 PetriNetUnfolder]: For 59327/59434 co-relation queries the response was YES. [2022-12-13 00:20:50,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44044 conditions, 6134 events. 2912/6134 cut-off events. For 59327/59434 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 59091 event pairs, 24 based on Foata normal form. 0/1966 useless extension candidates. Maximal degree in co-relation 43998. Up to 3189 conditions per place. [2022-12-13 00:20:50,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 877 transitions, 13872 flow [2022-12-13 00:20:50,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 8560 [2022-12-13 00:20:50,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:20:50,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:20:50,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:20:50,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:20:50,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:20:50,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:20:50,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:20:50,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:20:50,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:20:50,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1013 [2022-12-13 00:20:50,917 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 877 transitions, 13944 flow [2022-12-13 00:20:50,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:20:50,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:20:50,917 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:20:50,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 00:20:51,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 00:20:51,123 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:20:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:20:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -812182151, now seen corresponding path program 1 times [2022-12-13 00:20:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:20:51,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373268438] [2022-12-13 00:20:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:20:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:20:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:20:51,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373268438] [2022-12-13 00:20:51,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373268438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:20:51,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537681162] [2022-12-13 00:20:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:20:51,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:20:51,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:20:51,303 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:20:51,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 00:20:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:20:51,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 00:20:51,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:20:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:20:51,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:20:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:20:51,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537681162] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:20:51,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:20:51,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:20:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356632653] [2022-12-13 00:20:51,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:20:51,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:20:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:20:51,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:20:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:20:51,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 00:20:51,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 877 transitions, 13944 flow. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:20:51,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:20:51,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 00:20:51,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:20:58,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:00,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:02,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:04,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:06,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:08,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:11,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:13,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:15,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:16,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:18,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:22,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:24,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:26,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:28,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:30,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:32,121 INFO L130 PetriNetUnfolder]: 11656/20148 cut-off events. [2022-12-13 00:21:32,121 INFO L131 PetriNetUnfolder]: For 279779/279779 co-relation queries the response was YES. [2022-12-13 00:21:32,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125132 conditions, 20148 events. 11656/20148 cut-off events. For 279779/279779 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 179071 event pairs, 1186 based on Foata normal form. 322/9398 useless extension candidates. Maximal degree in co-relation 125083. Up to 13412 conditions per place. [2022-12-13 00:21:32,212 INFO L137 encePairwiseOnDemand]: 16/51 looper letters, 632 selfloop transitions, 452 changer transitions 1/1089 dead transitions. [2022-12-13 00:21:32,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1089 transitions, 17565 flow [2022-12-13 00:21:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:21:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:21:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 395 transitions. [2022-12-13 00:21:32,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43028322440087147 [2022-12-13 00:21:32,214 INFO L175 Difference]: Start difference. First operand has 136 places, 877 transitions, 13944 flow. Second operand 18 states and 395 transitions. [2022-12-13 00:21:32,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 1089 transitions, 17565 flow [2022-12-13 00:21:37,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 1089 transitions, 16136 flow, removed 574 selfloop flow, removed 11 redundant places. [2022-12-13 00:21:37,035 INFO L231 Difference]: Finished difference. Result has 148 places, 957 transitions, 14995 flow [2022-12-13 00:21:37,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=12631, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=379, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=14995, PETRI_PLACES=148, PETRI_TRANSITIONS=957} [2022-12-13 00:21:37,036 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2022-12-13 00:21:37,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:21:37,036 INFO L89 Accepts]: Start accepts. Operand has 148 places, 957 transitions, 14995 flow [2022-12-13 00:21:37,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:21:37,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:21:37,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 957 transitions, 14995 flow [2022-12-13 00:21:37,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 957 transitions, 14995 flow [2022-12-13 00:21:37,575 INFO L130 PetriNetUnfolder]: 2972/6326 cut-off events. [2022-12-13 00:21:37,575 INFO L131 PetriNetUnfolder]: For 63781/63897 co-relation queries the response was YES. [2022-12-13 00:21:37,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45242 conditions, 6326 events. 2972/6326 cut-off events. For 63781/63897 co-relation queries the response was YES. Maximal size of possible extension queue 1102. Compared 61699 event pairs, 24 based on Foata normal form. 0/2005 useless extension candidates. Maximal degree in co-relation 45191. Up to 3273 conditions per place. [2022-12-13 00:21:37,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 957 transitions, 14995 flow [2022-12-13 00:21:37,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 9244 [2022-12-13 00:21:37,644 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:21:37,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 609 [2022-12-13 00:21:37,645 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 957 transitions, 14995 flow [2022-12-13 00:21:37,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:21:37,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:21:37,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:21:37,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 00:21:37,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 00:21:37,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:21:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:21:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash -280098146, now seen corresponding path program 1 times [2022-12-13 00:21:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:21:37,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160809016] [2022-12-13 00:21:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:21:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:21:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:21:37,993 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-13 00:21:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:21:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160809016] [2022-12-13 00:21:37,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160809016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:21:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71092884] [2022-12-13 00:21:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:21:37,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:21:37,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:21:37,996 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:21:38,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 00:21:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:21:38,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 00:21:38,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:21:38,200 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-13 00:21:38,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:21:38,538 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-13 00:21:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71092884] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:21:38,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:21:38,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:21:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953693084] [2022-12-13 00:21:38,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:21:38,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:21:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:21:38,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:21:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:21:38,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 00:21:38,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 957 transitions, 14995 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:21:38,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:21:38,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 00:21:38,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:21:43,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:46,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:48,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:51,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:53,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:21:55,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:00,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:02,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:07,222 INFO L130 PetriNetUnfolder]: 13804/23977 cut-off events. [2022-12-13 00:22:07,222 INFO L131 PetriNetUnfolder]: For 423191/423191 co-relation queries the response was YES. [2022-12-13 00:22:07,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151080 conditions, 23977 events. 13804/23977 cut-off events. For 423191/423191 co-relation queries the response was YES. Maximal size of possible extension queue 2925. Compared 219368 event pairs, 696 based on Foata normal form. 448/11107 useless extension candidates. Maximal degree in co-relation 151026. Up to 11908 conditions per place. [2022-12-13 00:22:07,347 INFO L137 encePairwiseOnDemand]: 16/51 looper letters, 514 selfloop transitions, 818 changer transitions 6/1342 dead transitions. [2022-12-13 00:22:07,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1342 transitions, 21518 flow [2022-12-13 00:22:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 00:22:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 00:22:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 518 transitions. [2022-12-13 00:22:07,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40627450980392155 [2022-12-13 00:22:07,349 INFO L175 Difference]: Start difference. First operand has 147 places, 957 transitions, 14995 flow. Second operand 25 states and 518 transitions. [2022-12-13 00:22:07,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1342 transitions, 21518 flow [2022-12-13 00:22:14,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 1342 transitions, 20739 flow, removed 149 selfloop flow, removed 10 redundant places. [2022-12-13 00:22:14,768 INFO L231 Difference]: Finished difference. Result has 170 places, 1167 transitions, 20375 flow [2022-12-13 00:22:14,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=14252, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=632, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=20375, PETRI_PLACES=170, PETRI_TRANSITIONS=1167} [2022-12-13 00:22:14,769 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2022-12-13 00:22:14,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:22:14,769 INFO L89 Accepts]: Start accepts. Operand has 170 places, 1167 transitions, 20375 flow [2022-12-13 00:22:14,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:22:14,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:22:14,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 1167 transitions, 20375 flow [2022-12-13 00:22:14,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 1167 transitions, 20375 flow [2022-12-13 00:22:15,549 INFO L130 PetriNetUnfolder]: 3532/7581 cut-off events. [2022-12-13 00:22:15,550 INFO L131 PetriNetUnfolder]: For 114043/114159 co-relation queries the response was YES. [2022-12-13 00:22:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61310 conditions, 7581 events. 3532/7581 cut-off events. For 114043/114159 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 76009 event pairs, 8 based on Foata normal form. 0/2397 useless extension candidates. Maximal degree in co-relation 61249. Up to 4217 conditions per place. [2022-12-13 00:22:15,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 1167 transitions, 20375 flow [2022-12-13 00:22:15,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 11068 [2022-12-13 00:22:15,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:22:15,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:22:15,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:22:15,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:22:15,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:22:16,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:22:16,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:22:16,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:22:16,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L705-6-->L695-4: Formula: (and (= (+ 16 v_~x~0_250) v_~x~0_249) (= (* 610 v_~prev~0_259) (+ (* 377 v_~next~0_138) v_~prev~0_260 v_~cur~0_226)) (= v_~j~0_191 (+ v_~j~0_192 v_~i~0_195)) (< v_~x~0_249 17) (= v_~q~0_83 (+ |v_t2Thread1of1ForFork0_#t~post2_55| 1)) (< v_~q~0_84 7) (= v_~q~0_84 |v_t2Thread1of1ForFork0_#t~post2_55|) (= v_~next~0_138 v_~cur~0_225) (= (+ v_~cur~0_226 (* v_~prev~0_259 987)) (* 610 v_~next~0_138))) InVars {~j~0=v_~j~0_192, ~prev~0=v_~prev~0_260, ~i~0=v_~i~0_195, ~q~0=v_~q~0_84, ~cur~0=v_~cur~0_226, ~x~0=v_~x~0_250} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_151|, ~j~0=v_~j~0_191, ~next~0=v_~next~0_138, ~prev~0=v_~prev~0_259, ~i~0=v_~i~0_195, ~q~0=v_~q~0_83, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_55|, ~cur~0=v_~cur~0_225, ~x~0=v_~x~0_249} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:22:16,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L705-6-->L695-3: Formula: (and (= (* 610 v_~prev~0_251) (+ (* 377 v_~next~0_134) v_~prev~0_252 v_~cur~0_218)) (= v_~next~0_134 v_~cur~0_217) (= (* 610 v_~next~0_134) (+ (* v_~prev~0_251 987) v_~cur~0_218)) (= (+ 16 v_~x~0_242) v_~x~0_241) (= v_~j~0_183 (+ v_~j~0_184 v_~i~0_191)) (< v_~q~0_79 7) (= v_~q~0_79 |v_t2Thread1of1ForFork0_#t~post2_53|) (< v_~x~0_241 17)) InVars {~j~0=v_~j~0_184, ~prev~0=v_~prev~0_252, ~i~0=v_~i~0_191, ~q~0=v_~q~0_79, ~cur~0=v_~cur~0_218, ~x~0=v_~x~0_242} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_147|, ~j~0=v_~j~0_183, ~next~0=v_~next~0_134, ~prev~0=v_~prev~0_251, ~i~0=v_~i~0_191, ~q~0=v_~q~0_79, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_53|, ~cur~0=v_~cur~0_217, ~x~0=v_~x~0_241} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:22:16,265 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L705-6-->L698: Formula: (and (= v_~j~0_187 (+ v_~j~0_188 v_~i~0_193)) (= (+ 16 v_~x~0_246) v_~x~0_245) (< v_~x~0_245 17) (< v_~q~0_81 7) (= (+ (* v_~prev~0_255 987) v_~cur~0_222) (* 610 v_~next~0_136)) (= (* 610 v_~prev~0_255) (+ (* 377 v_~next~0_136) v_~prev~0_256 v_~cur~0_222)) (= v_~next~0_136 v_~cur~0_221)) InVars {~j~0=v_~j~0_188, ~prev~0=v_~prev~0_256, ~i~0=v_~i~0_193, ~q~0=v_~q~0_81, ~cur~0=v_~cur~0_222, ~x~0=v_~x~0_246} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_149|, ~j~0=v_~j~0_187, ~next~0=v_~next~0_136, ~prev~0=v_~prev~0_255, ~i~0=v_~i~0_193, ~q~0=v_~q~0_81, ~cur~0=v_~cur~0_221, ~x~0=v_~x~0_245} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:22:16,326 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:22:16,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1558 [2022-12-13 00:22:16,327 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 1166 transitions, 20465 flow [2022-12-13 00:22:16,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:22:16,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:22:16,327 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:22:16,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 00:22:16,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:22:16,531 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:22:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:22:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash -43838966, now seen corresponding path program 1 times [2022-12-13 00:22:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:22:16,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361873010] [2022-12-13 00:22:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:22:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:22:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:22:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:22:16,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:22:16,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361873010] [2022-12-13 00:22:16,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361873010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:22:16,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628065534] [2022-12-13 00:22:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:22:16,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:22:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:22:16,688 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:22:16,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 00:22:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:22:16,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:22:16,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:22:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:22:16,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:22:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:22:17,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628065534] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:22:17,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:22:17,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:22:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458715559] [2022-12-13 00:22:17,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:22:17,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:22:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:22:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:22:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:22:17,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 59 [2022-12-13 00:22:17,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 1166 transitions, 20465 flow. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:22:17,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:22:17,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 59 [2022-12-13 00:22:17,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:22:22,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:28,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:29,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:31,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:33,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:36,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:38,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:40,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:42,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:44,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:46,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:48,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:50,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:52,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:54,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:56,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:22:58,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:00,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:02,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:04,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:07,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:09,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:11,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:15,416 INFO L130 PetriNetUnfolder]: 14796/25817 cut-off events. [2022-12-13 00:23:15,416 INFO L131 PetriNetUnfolder]: For 670203/670203 co-relation queries the response was YES. [2022-12-13 00:23:15,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179040 conditions, 25817 events. 14796/25817 cut-off events. For 670203/670203 co-relation queries the response was YES. Maximal size of possible extension queue 3075. Compared 238401 event pairs, 2232 based on Foata normal form. 497/11845 useless extension candidates. Maximal degree in co-relation 178976. Up to 19333 conditions per place. [2022-12-13 00:23:15,567 INFO L137 encePairwiseOnDemand]: 24/59 looper letters, 946 selfloop transitions, 487 changer transitions 1/1438 dead transitions. [2022-12-13 00:23:15,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1438 transitions, 25825 flow [2022-12-13 00:23:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 00:23:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 00:23:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 450 transitions. [2022-12-13 00:23:15,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36319612590799033 [2022-12-13 00:23:15,569 INFO L175 Difference]: Start difference. First operand has 169 places, 1166 transitions, 20465 flow. Second operand 21 states and 450 transitions. [2022-12-13 00:23:15,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1438 transitions, 25825 flow [2022-12-13 00:23:25,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1438 transitions, 24066 flow, removed 652 selfloop flow, removed 10 redundant places. [2022-12-13 00:23:25,726 INFO L231 Difference]: Finished difference. Result has 186 places, 1294 transitions, 22429 flow [2022-12-13 00:23:25,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=18772, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=390, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=22429, PETRI_PLACES=186, PETRI_TRANSITIONS=1294} [2022-12-13 00:23:25,727 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2022-12-13 00:23:25,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:23:25,727 INFO L89 Accepts]: Start accepts. Operand has 186 places, 1294 transitions, 22429 flow [2022-12-13 00:23:25,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:23:25,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:23:25,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 1294 transitions, 22429 flow [2022-12-13 00:23:25,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 1294 transitions, 22429 flow [2022-12-13 00:23:26,689 INFO L130 PetriNetUnfolder]: 3881/8290 cut-off events. [2022-12-13 00:23:26,689 INFO L131 PetriNetUnfolder]: For 150338/150463 co-relation queries the response was YES. [2022-12-13 00:23:26,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66857 conditions, 8290 events. 3881/8290 cut-off events. For 150338/150463 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 82634 event pairs, 20 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 66790. Up to 4757 conditions per place. [2022-12-13 00:23:26,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 1294 transitions, 22429 flow [2022-12-13 00:23:26,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 12244 [2022-12-13 00:23:26,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:23:26,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:23:26,856 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:23:26,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:23:26,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:23:26,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:27,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:27,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= (* 610 v_~prev~0_153) (+ v_~prev~0_155 v_~cur~0_129 (* 377 v_~next~0_82))) (= v_~cur~0_127 v_~next~0_82) (= (+ 16 v_~x~0_143) v_~x~0_141) (= (+ (* v_~prev~0_153 987) v_~cur~0_129) (* 610 v_~next~0_82)) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_153, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:27,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [278] L687-5-->L690: Formula: (and (= v_~i~0_29 (+ v_~i~0_30 v_~j~0_37)) (< v_~p~0_21 7)) InVars {~j~0=v_~j~0_37, ~i~0=v_~i~0_30, ~p~0=v_~p~0_21} OutVars{~j~0=v_~j~0_37, ~i~0=v_~i~0_29, ~p~0=v_~p~0_21} AuxVars[] AssignedVars[~i~0] [2022-12-13 00:23:27,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [283] L695-5-->L695-3: Formula: (and (= v_~j~0_47 (+ v_~i~0_39 v_~j~0_48)) (= v_~q~0_19 |v_t2Thread1of1ForFork0_#t~post2_11|) (< v_~q~0_19 7)) InVars {~j~0=v_~j~0_48, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19} OutVars{~j~0=v_~j~0_47, ~i~0=v_~i~0_39, ~q~0=v_~q~0_19, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_11|} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:27,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [322] L687-5-->L687-4: Formula: (and (= v_~p~0_44 |v_t1Thread1of1ForFork1_#t~post1_19|) (= v_~p~0_43 (+ |v_t1Thread1of1ForFork1_#t~post1_19| 1)) (= (+ v_~j~0_107 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_107, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44} OutVars{~j~0=v_~j~0_107, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_19|, ~p~0=v_~p~0_43} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:23:27,353 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [323] L687-5-->L687-5: Formula: (and (= v_~p~0_47 (+ v_~p~0_48 1)) (< v_~p~0_48 7) (= (+ v_~j~0_109 v_~i~0_112) v_~i~0_111)) InVars {~j~0=v_~j~0_109, ~i~0=v_~i~0_112, ~p~0=v_~p~0_48} OutVars{~j~0=v_~j~0_109, ~i~0=v_~i~0_111, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_21|, ~p~0=v_~p~0_47} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-13 00:23:27,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [282] L695-5-->L698: Formula: (and (< v_~q~0_17 7) (= v_~j~0_43 (+ v_~i~0_37 v_~j~0_44))) InVars {~j~0=v_~j~0_44, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} OutVars{~j~0=v_~j~0_43, ~i~0=v_~i~0_37, ~q~0=v_~q~0_17} AuxVars[] AssignedVars[~j~0] [2022-12-13 00:23:27,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_25 (+ v_~q~0_26 1)) (< v_~q~0_26 7) (= v_~j~0_75 (+ v_~i~0_71 v_~j~0_76))) InVars {~j~0=v_~j~0_76, ~i~0=v_~i~0_71, ~q~0=v_~q~0_26} OutVars{~j~0=v_~j~0_75, ~i~0=v_~i~0_71, ~q~0=v_~q~0_25, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_19|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:27,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [279] L687-5-->L687-3: Formula: (and (= v_~i~0_33 (+ v_~i~0_34 v_~j~0_39)) (< v_~p~0_23 7) (= v_~p~0_23 |v_t1Thread1of1ForFork1_#t~post1_15|)) InVars {~j~0=v_~j~0_39, ~i~0=v_~i~0_34, ~p~0=v_~p~0_23} OutVars{~j~0=v_~j~0_39, ~i~0=v_~i~0_33, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_15|, ~p~0=v_~p~0_23} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1] [2022-12-13 00:23:27,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [333] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_fib_#res#1_38| v_~prev~0_59) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (<= |v_ULTIMATE.start_main_~correct~0#1_64| 2147483647) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= |v_ULTIMATE.start_main_~assert_cond~0#1_62| (ite (= (ite (and (<= v_~i~0_119 |v_ULTIMATE.start_main_~correct~0#1_64|) (<= v_~j~0_115 |v_ULTIMATE.start_main_~correct~0#1_64|)) 1 0) 0) 0 1)) (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_62| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_64| 2147483648)) (not (< v_~x~0_35 16)) (= |v_ULTIMATE.start_fib_#res#1_38| |v_ULTIMATE.start_main_~correct~0#1_64|)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ~i~0=v_~i~0_119, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_80|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~j~0=v_~j~0_115, ~prev~0=v_~prev~0_59, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~i~0=v_~i~0_119, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_38|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_64|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_62|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [304] L695-5-->L695-4: Formula: (and (< v_~q~0_30 7) (= v_~q~0_29 (+ |v_t2Thread1of1ForFork0_#t~post2_23| 1)) (= v_~q~0_30 |v_t2Thread1of1ForFork0_#t~post2_23|) (= v_~j~0_79 (+ v_~i~0_73 v_~j~0_80))) InVars {~j~0=v_~j~0_80, ~i~0=v_~i~0_73, ~q~0=v_~q~0_30} OutVars{~j~0=v_~j~0_79, ~i~0=v_~i~0_73, ~q~0=v_~q~0_29, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_23|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-13 00:23:27,744 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:23:27,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2018 [2022-12-13 00:23:27,745 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 1294 transitions, 23077 flow [2022-12-13 00:23:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:23:27,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:23:27,745 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:23:27,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 00:23:27,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:23:27,947 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:23:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:23:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash -261594215, now seen corresponding path program 1 times [2022-12-13 00:23:27,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:23:27,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14283007] [2022-12-13 00:23:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:23:27,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:23:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:23:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:23:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:23:28,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14283007] [2022-12-13 00:23:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14283007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:23:28,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312264167] [2022-12-13 00:23:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:23:28,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:23:28,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:23:28,223 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:23:28,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 00:23:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:23:28,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:23:28,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:23:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:23:28,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:23:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:23:28,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312264167] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:23:28,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:23:28,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:23:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521616206] [2022-12-13 00:23:28,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:23:28,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:23:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:23:28,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:23:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:23:28,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 75 [2022-12-13 00:23:28,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 1294 transitions, 23077 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:23:28,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:23:28,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 75 [2022-12-13 00:23:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:23:35,662 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:23:38,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:40,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:42,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:43,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:45,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:47,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:50,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:52,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:23:54,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:07,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:09,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:11,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:13,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:15,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:21,322 INFO L130 PetriNetUnfolder]: 15145/26622 cut-off events. [2022-12-13 00:24:21,322 INFO L131 PetriNetUnfolder]: For 625600/625600 co-relation queries the response was YES. [2022-12-13 00:24:21,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187391 conditions, 26622 events. 15145/26622 cut-off events. For 625600/625600 co-relation queries the response was YES. Maximal size of possible extension queue 3254. Compared 249876 event pairs, 1893 based on Foata normal form. 168/11770 useless extension candidates. Maximal degree in co-relation 187321. Up to 18535 conditions per place. [2022-12-13 00:24:21,494 INFO L137 encePairwiseOnDemand]: 32/75 looper letters, 911 selfloop transitions, 573 changer transitions 10/1498 dead transitions. [2022-12-13 00:24:21,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 1498 transitions, 27651 flow [2022-12-13 00:24:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 00:24:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 00:24:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 418 transitions. [2022-12-13 00:24:21,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30962962962962964 [2022-12-13 00:24:21,495 INFO L175 Difference]: Start difference. First operand has 185 places, 1294 transitions, 23077 flow. Second operand 18 states and 418 transitions. [2022-12-13 00:24:21,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 1498 transitions, 27651 flow [2022-12-13 00:24:35,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1498 transitions, 25779 flow, removed 790 selfloop flow, removed 11 redundant places. [2022-12-13 00:24:35,507 INFO L231 Difference]: Finished difference. Result has 195 places, 1356 transitions, 24035 flow [2022-12-13 00:24:35,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=21205, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=24035, PETRI_PLACES=195, PETRI_TRANSITIONS=1356} [2022-12-13 00:24:35,508 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2022-12-13 00:24:35,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:24:35,508 INFO L89 Accepts]: Start accepts. Operand has 195 places, 1356 transitions, 24035 flow [2022-12-13 00:24:35,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:24:35,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:24:35,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 1356 transitions, 24035 flow [2022-12-13 00:24:35,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 1356 transitions, 24035 flow [2022-12-13 00:24:36,647 INFO L130 PetriNetUnfolder]: 4023/8694 cut-off events. [2022-12-13 00:24:36,647 INFO L131 PetriNetUnfolder]: For 178239/178346 co-relation queries the response was YES. [2022-12-13 00:24:36,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72022 conditions, 8694 events. 4023/8694 cut-off events. For 178239/178346 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 89462 event pairs, 20 based on Foata normal form. 0/2694 useless extension candidates. Maximal degree in co-relation 71951. Up to 4663 conditions per place. [2022-12-13 00:24:36,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 1356 transitions, 24035 flow [2022-12-13 00:24:36,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 12724 [2022-12-13 00:24:36,788 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:24:36,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1280 [2022-12-13 00:24:36,788 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 1356 transitions, 24035 flow [2022-12-13 00:24:36,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:24:36,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:24:36,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:24:36,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 00:24:36,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:24:36,989 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:24:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:24:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash -281262568, now seen corresponding path program 1 times [2022-12-13 00:24:36,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:24:36,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792952452] [2022-12-13 00:24:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:24:36,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:24:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:24:37,185 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-13 00:24:37,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:24:37,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792952452] [2022-12-13 00:24:37,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792952452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:24:37,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049457534] [2022-12-13 00:24:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:24:37,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:24:37,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:24:37,188 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:24:37,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 00:24:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:24:37,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 00:24:37,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:24:37,405 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-13 00:24:37,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:24:37,701 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-13 00:24:37,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049457534] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:24:37,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:24:37,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 00:24:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320029597] [2022-12-13 00:24:37,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:24:37,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 00:24:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:24:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 00:24:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 00:24:37,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 75 [2022-12-13 00:24:37,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1356 transitions, 24035 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:24:37,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:24:37,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 75 [2022-12-13 00:24:37,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:24:52,559 WARN L233 SmtUtils]: Spent 13.05s on a formula simplification. DAG size of input: 64 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:24:55,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:57,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:24:59,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:01,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:04,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:07,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:14,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:16,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:18,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:22,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:25,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:32,926 INFO L130 PetriNetUnfolder]: 16326/28818 cut-off events. [2022-12-13 00:25:32,926 INFO L131 PetriNetUnfolder]: For 840524/840524 co-relation queries the response was YES. [2022-12-13 00:25:33,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204222 conditions, 28818 events. 16326/28818 cut-off events. For 840524/840524 co-relation queries the response was YES. Maximal size of possible extension queue 3460. Compared 275169 event pairs, 2061 based on Foata normal form. 294/12700 useless extension candidates. Maximal degree in co-relation 204148. Up to 19223 conditions per place. [2022-12-13 00:25:33,127 INFO L137 encePairwiseOnDemand]: 24/75 looper letters, 896 selfloop transitions, 772 changer transitions 0/1672 dead transitions. [2022-12-13 00:25:33,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1672 transitions, 30423 flow [2022-12-13 00:25:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 00:25:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 00:25:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 502 transitions. [2022-12-13 00:25:33,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2910144927536232 [2022-12-13 00:25:33,129 INFO L175 Difference]: Start difference. First operand has 194 places, 1356 transitions, 24035 flow. Second operand 23 states and 502 transitions. [2022-12-13 00:25:33,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1672 transitions, 30423 flow [2022-12-13 00:25:46,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1672 transitions, 29939 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-12-13 00:25:46,881 INFO L231 Difference]: Finished difference. Result has 211 places, 1518 transitions, 28852 flow [2022-12-13 00:25:46,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=23567, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=658, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=28852, PETRI_PLACES=211, PETRI_TRANSITIONS=1518} [2022-12-13 00:25:46,882 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2022-12-13 00:25:46,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:25:46,883 INFO L89 Accepts]: Start accepts. Operand has 211 places, 1518 transitions, 28852 flow [2022-12-13 00:25:46,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:25:46,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:25:46,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 1518 transitions, 28852 flow [2022-12-13 00:25:46,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 1518 transitions, 28852 flow [2022-12-13 00:25:48,096 INFO L130 PetriNetUnfolder]: 4327/9530 cut-off events. [2022-12-13 00:25:48,096 INFO L131 PetriNetUnfolder]: For 198064/198171 co-relation queries the response was YES. [2022-12-13 00:25:48,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83173 conditions, 9530 events. 4327/9530 cut-off events. For 198064/198171 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 100474 event pairs, 20 based on Foata normal form. 0/2923 useless extension candidates. Maximal degree in co-relation 83097. Up to 5223 conditions per place. [2022-12-13 00:25:48,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 1518 transitions, 28852 flow [2022-12-13 00:25:48,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 14084 [2022-12-13 00:25:48,210 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:25:48,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1327 [2022-12-13 00:25:48,210 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 1518 transitions, 28852 flow [2022-12-13 00:25:48,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:25:48,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:25:48,210 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:25:48,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 00:25:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 00:25:48,413 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting L690 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:25:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:25:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -110635836, now seen corresponding path program 1 times [2022-12-13 00:25:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:25:48,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929464569] [2022-12-13 00:25:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:25:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:25:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:25:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:25:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:25:48,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929464569] [2022-12-13 00:25:48,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929464569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:25:48,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104392921] [2022-12-13 00:25:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:25:48,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:25:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:25:48,576 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:25:48,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 00:25:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:25:48,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:25:48,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:25:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:25:48,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:25:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:25:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104392921] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:25:49,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:25:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:25:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109690659] [2022-12-13 00:25:49,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:25:49,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:25:49,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:25:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:25:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:25:49,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 75 [2022-12-13 00:25:49,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 1518 transitions, 28852 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:25:49,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:25:49,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 75 [2022-12-13 00:25:49,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:25:51,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:25:54,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:01,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:07,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:09,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:16,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:18,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:20,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:23,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:27,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:29,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:33,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:36,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:38,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:26:41,866 INFO L130 PetriNetUnfolder]: 16522/29321 cut-off events. [2022-12-13 00:26:41,867 INFO L131 PetriNetUnfolder]: For 966180/966180 co-relation queries the response was YES. [2022-12-13 00:26:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219808 conditions, 29321 events. 16522/29321 cut-off events. For 966180/966180 co-relation queries the response was YES. Maximal size of possible extension queue 3484. Compared 282714 event pairs, 2239 based on Foata normal form. 383/12936 useless extension candidates. Maximal degree in co-relation 219729. Up to 20538 conditions per place. [2022-12-13 00:26:42,217 INFO L137 encePairwiseOnDemand]: 24/75 looper letters, 1027 selfloop transitions, 684 changer transitions 0/1715 dead transitions. [2022-12-13 00:26:42,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1715 transitions, 33855 flow [2022-12-13 00:26:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 00:26:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 00:26:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 464 transitions. [2022-12-13 00:26:42,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2946031746031746 [2022-12-13 00:26:42,219 INFO L175 Difference]: Start difference. First operand has 211 places, 1518 transitions, 28852 flow. Second operand 21 states and 464 transitions. [2022-12-13 00:26:42,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1715 transitions, 33855 flow [2022-12-13 00:27:00,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1715 transitions, 33098 flow, removed 266 selfloop flow, removed 8 redundant places. [2022-12-13 00:27:00,686 INFO L231 Difference]: Finished difference. Result has 225 places, 1573 transitions, 31318 flow [2022-12-13 00:27:00,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=27708, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=620, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=31318, PETRI_PLACES=225, PETRI_TRANSITIONS=1573} [2022-12-13 00:27:00,687 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 193 predicate places. [2022-12-13 00:27:00,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:27:00,687 INFO L89 Accepts]: Start accepts. Operand has 225 places, 1573 transitions, 31318 flow [2022-12-13 00:27:00,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:27:00,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:27:00,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 1573 transitions, 31318 flow [2022-12-13 00:27:00,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 1573 transitions, 31318 flow [2022-12-13 00:27:02,227 INFO L130 PetriNetUnfolder]: 4403/9786 cut-off events. [2022-12-13 00:27:02,227 INFO L131 PetriNetUnfolder]: For 215592/215735 co-relation queries the response was YES. [2022-12-13 00:27:02,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88909 conditions, 9786 events. 4403/9786 cut-off events. For 215592/215735 co-relation queries the response was YES. Maximal size of possible extension queue 1640. Compared 103804 event pairs, 24 based on Foata normal form. 0/2996 useless extension candidates. Maximal degree in co-relation 88830. Up to 5395 conditions per place. [2022-12-13 00:27:02,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 1573 transitions, 31318 flow [2022-12-13 00:27:02,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 14496 [2022-12-13 00:27:02,333 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:27:02,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1646 [2022-12-13 00:27:02,333 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 1573 transitions, 31318 flow [2022-12-13 00:27:02,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:27:02,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:27:02,334 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:27:02,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 00:27:02,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 00:27:02,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:27:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:27:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash 514082052, now seen corresponding path program 1 times [2022-12-13 00:27:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:27:02,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986562527] [2022-12-13 00:27:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:27:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:27:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:27:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:27:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:27:02,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986562527] [2022-12-13 00:27:02,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986562527] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:27:02,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796759590] [2022-12-13 00:27:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:27:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:27:02,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:27:02,856 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:27:02,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 00:27:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:27:02,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:27:02,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:27:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:27:03,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:27:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:27:03,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796759590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:27:03,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:27:03,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:27:03,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812147070] [2022-12-13 00:27:03,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:27:03,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:27:03,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:27:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:27:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:27:03,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-13 00:27:03,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1573 transitions, 31318 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:27:03,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:27:03,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-13 00:27:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:27:09,053 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 61 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:27:16,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:18,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:20,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:22,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:24,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:27,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:29,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:36,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:38,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:39,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:41,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:44,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:47,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:49,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:52,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:54,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:56,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:27:59,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:01,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:04,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:06,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:08,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:10,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:12,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:14,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:16,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:18,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:22,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:25,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:27,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:29,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:31,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:33,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:35,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:37,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:28:45,468 INFO L130 PetriNetUnfolder]: 17775/32035 cut-off events. [2022-12-13 00:28:45,468 INFO L131 PetriNetUnfolder]: For 1056909/1056909 co-relation queries the response was YES. [2022-12-13 00:28:45,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245025 conditions, 32035 events. 17775/32035 cut-off events. For 1056909/1056909 co-relation queries the response was YES. Maximal size of possible extension queue 3753. Compared 316294 event pairs, 2422 based on Foata normal form. 392/13949 useless extension candidates. Maximal degree in co-relation 244943. Up to 22200 conditions per place. [2022-12-13 00:28:45,712 INFO L137 encePairwiseOnDemand]: 24/67 looper letters, 1213 selfloop transitions, 742 changer transitions 0/1959 dead transitions. [2022-12-13 00:28:45,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1959 transitions, 40200 flow [2022-12-13 00:28:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 00:28:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 00:28:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 532 transitions. [2022-12-13 00:28:45,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3176119402985075 [2022-12-13 00:28:45,713 INFO L175 Difference]: Start difference. First operand has 225 places, 1573 transitions, 31318 flow. Second operand 25 states and 532 transitions. [2022-12-13 00:28:45,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 1959 transitions, 40200 flow [2022-12-13 00:29:10,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1959 transitions, 38693 flow, removed 533 selfloop flow, removed 11 redundant places. [2022-12-13 00:29:10,494 INFO L231 Difference]: Finished difference. Result has 244 places, 1790 transitions, 37059 flow [2022-12-13 00:29:10,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=29973, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=37059, PETRI_PLACES=244, PETRI_TRANSITIONS=1790} [2022-12-13 00:29:10,495 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 212 predicate places. [2022-12-13 00:29:10,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:29:10,495 INFO L89 Accepts]: Start accepts. Operand has 244 places, 1790 transitions, 37059 flow [2022-12-13 00:29:10,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:29:10,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:29:10,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 1790 transitions, 37059 flow [2022-12-13 00:29:10,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 1790 transitions, 37059 flow [2022-12-13 00:29:12,295 INFO L130 PetriNetUnfolder]: 4835/10978 cut-off events. [2022-12-13 00:29:12,296 INFO L131 PetriNetUnfolder]: For 248736/248879 co-relation queries the response was YES. [2022-12-13 00:29:12,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102062 conditions, 10978 events. 4835/10978 cut-off events. For 248736/248879 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 119950 event pairs, 24 based on Foata normal form. 0/3318 useless extension candidates. Maximal degree in co-relation 101977. Up to 5867 conditions per place. [2022-12-13 00:29:12,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 1790 transitions, 37059 flow [2022-12-13 00:29:12,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 16288 [2022-12-13 00:29:12,422 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:29:12,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1928 [2022-12-13 00:29:12,423 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 1790 transitions, 37059 flow [2022-12-13 00:29:12,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:29:12,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:29:12,423 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:29:12,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 00:29:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:29:12,628 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:29:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:29:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1132046878, now seen corresponding path program 1 times [2022-12-13 00:29:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:29:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216826867] [2022-12-13 00:29:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:29:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:29:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:29:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:29:12,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:29:12,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216826867] [2022-12-13 00:29:12,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216826867] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:29:12,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433645793] [2022-12-13 00:29:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:29:12,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:29:12,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:29:12,804 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:29:12,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 00:29:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:29:12,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:29:12,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:29:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:29:13,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:29:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:29:13,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433645793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:29:13,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:29:13,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-13 00:29:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469207049] [2022-12-13 00:29:13,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:29:13,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 00:29:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:29:13,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 00:29:13,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-13 00:29:13,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-13 00:29:13,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 1790 transitions, 37059 flow. Second operand has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:29:13,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:29:13,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-13 00:29:13,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:29:15,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:23,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:26,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:28,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:30,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:32,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:42,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:44,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:46,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:48,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:51,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:53,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:55,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:57,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:29:59,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:02,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:04,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:09,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:11,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:12,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:14,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:16,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:18,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:22,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:24,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:26,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:28,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:29,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:32,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:30:40,178 INFO L130 PetriNetUnfolder]: 20766/37189 cut-off events. [2022-12-13 00:30:40,178 INFO L131 PetriNetUnfolder]: For 1539856/1539856 co-relation queries the response was YES. [2022-12-13 00:30:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303768 conditions, 37189 events. 20766/37189 cut-off events. For 1539856/1539856 co-relation queries the response was YES. Maximal size of possible extension queue 4131. Compared 371181 event pairs, 2956 based on Foata normal form. 357/16312 useless extension candidates. Maximal degree in co-relation 303680. Up to 23677 conditions per place. [2022-12-13 00:30:40,580 INFO L137 encePairwiseOnDemand]: 24/67 looper letters, 1342 selfloop transitions, 877 changer transitions 0/2223 dead transitions. [2022-12-13 00:30:40,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 2223 transitions, 47816 flow [2022-12-13 00:30:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 00:30:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 00:30:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 575 transitions. [2022-12-13 00:30:40,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33008036739380026 [2022-12-13 00:30:40,582 INFO L175 Difference]: Start difference. First operand has 244 places, 1790 transitions, 37059 flow. Second operand 26 states and 575 transitions. [2022-12-13 00:30:40,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 2223 transitions, 47816 flow [2022-12-13 00:31:19,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 2223 transitions, 46373 flow, removed 526 selfloop flow, removed 12 redundant places. [2022-12-13 00:31:19,803 INFO L231 Difference]: Finished difference. Result has 270 places, 2029 transitions, 44324 flow [2022-12-13 00:31:19,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=35616, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=655, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1068, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=44324, PETRI_PLACES=270, PETRI_TRANSITIONS=2029} [2022-12-13 00:31:19,804 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 238 predicate places. [2022-12-13 00:31:19,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:31:19,805 INFO L89 Accepts]: Start accepts. Operand has 270 places, 2029 transitions, 44324 flow [2022-12-13 00:31:19,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:31:19,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:31:19,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 2029 transitions, 44324 flow [2022-12-13 00:31:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 2029 transitions, 44324 flow [2022-12-13 00:31:22,287 INFO L130 PetriNetUnfolder]: 5692/12690 cut-off events. [2022-12-13 00:31:22,287 INFO L131 PetriNetUnfolder]: For 448160/448303 co-relation queries the response was YES. [2022-12-13 00:31:22,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129037 conditions, 12690 events. 5692/12690 cut-off events. For 448160/448303 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 139371 event pairs, 24 based on Foata normal form. 0/3943 useless extension candidates. Maximal degree in co-relation 128938. Up to 6699 conditions per place. [2022-12-13 00:31:22,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 2029 transitions, 44324 flow [2022-12-13 00:31:22,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 18572 [2022-12-13 00:31:22,617 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:31:22,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2812 [2022-12-13 00:31:22,618 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 2029 transitions, 44324 flow [2022-12-13 00:31:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:22,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:31:22,618 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:31:22,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 00:31:22,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:22,819 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 00:31:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:31:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash -666527094, now seen corresponding path program 1 times [2022-12-13 00:31:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:31:22,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59086772] [2022-12-13 00:31:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:31:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:31:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59086772] [2022-12-13 00:31:22,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59086772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 00:31:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832224399] [2022-12-13 00:31:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:31:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:31:22,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:31:22,996 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:31:22,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 00:31:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:31:23,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 00:31:23,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:31:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:23,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:31:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:31:23,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832224399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:31:23,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 00:31:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 00:31:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696025567] [2022-12-13 00:31:23,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 00:31:23,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 00:31:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:31:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 00:31:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-13 00:31:23,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 67 [2022-12-13 00:31:23,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 2029 transitions, 44324 flow. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:31:23,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:31:23,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 67 [2022-12-13 00:31:23,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:31:29,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:31,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:33,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 00:31:35,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-13 00:31:36,009 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-13 00:31:36,024 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 00:31:37,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 00:31:37,210 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 00:31:37,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-13 00:31:37,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 00:31:37,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 00:31:37,226 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 00:31:37,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 00:31:37,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 00:31:37,227 INFO L445 BasicCegarLoop]: Path program 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-13 00:31:37,230 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:31:37,230 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:31:37,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:31:37 BasicIcfg [2022-12-13 00:31:37,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:31:37,232 INFO L158 Benchmark]: Toolchain (without parser) took 865198.96ms. Allocated memory was 177.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 151.5MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 291.7MB. Max. memory is 8.0GB. [2022-12-13 00:31:37,232 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 177.2MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:31:37,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.50ms. Allocated memory is still 177.2MB. Free memory was 151.5MB in the beginning and 130.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 00:31:37,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.18ms. Allocated memory is still 177.2MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:31:37,233 INFO L158 Benchmark]: Boogie Preprocessor took 55.03ms. Allocated memory is still 177.2MB. Free memory was 128.4MB in the beginning and 126.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 00:31:37,233 INFO L158 Benchmark]: RCFGBuilder took 620.16ms. Allocated memory is still 177.2MB. Free memory was 126.8MB in the beginning and 113.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 00:31:37,233 INFO L158 Benchmark]: TraceAbstraction took 863646.33ms. Allocated memory was 177.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 111.6MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 251.8MB. Max. memory is 8.0GB. [2022-12-13 00:31:37,234 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 177.2MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 785.50ms. Allocated memory is still 177.2MB. Free memory was 151.5MB in the beginning and 130.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.18ms. Allocated memory is still 177.2MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.03ms. Allocated memory is still 177.2MB. Free memory was 128.4MB in the beginning and 126.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 620.16ms. Allocated memory is still 177.2MB. Free memory was 126.8MB in the beginning and 113.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 863646.33ms. Allocated memory was 177.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 111.6MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 251.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 91 PlacesBefore, 32 PlacesAfterwards, 91 TransitionsBefore, 28 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 6 ChoiceCompositions, 79 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 1655, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1670, independent: 1655, independent conditional: 0, independent unconditional: 1655, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1406, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1406, independent: 1395, independent conditional: 0, independent unconditional: 1395, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1670, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1406, unknown conditional: 0, unknown unconditional: 1406] , Statistics on independence cache: Total cache size (in pairs): 2636, Positive cache size: 2625, Positive conditional cache size: 0, Positive unconditional cache size: 2625, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 32 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 400 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.3s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 60, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 120, 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.4s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 60, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 300, 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.3s, 39 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 0, independent unconditional: 60, 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: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 420, 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.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 560, 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.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 720, Positive conditional cache size: 720, 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.2s, 37 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 800, Positive cache size: 800, Positive conditional cache size: 800, 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: 1.0s, 42 PlacesBefore, 41 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 216, independent: 216, independent conditional: 216, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 216, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 39 PlacesBefore, 39 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 904 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 51 PlacesBefore, 51 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 1940 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 52 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 1632 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 66 PlacesBefore, 66 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 2488 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 78 PlacesBefore, 78 PlacesAfterwards, 306 TransitionsBefore, 306 TransitionsAfterwards, 3424 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 87 PlacesBefore, 87 PlacesAfterwards, 362 TransitionsBefore, 362 TransitionsAfterwards, 3840 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 99 PlacesBefore, 99 PlacesAfterwards, 479 TransitionsBefore, 479 TransitionsAfterwards, 4832 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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, 109 PlacesBefore, 109 PlacesAfterwards, 613 TransitionsBefore, 613 TransitionsAfterwards, 6176 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): 864, Positive cache size: 864, Positive conditional cache size: 864, 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.4s, 136 PlacesBefore, 136 PlacesAfterwards, 877 TransitionsBefore, 877 TransitionsAfterwards, 8560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 80, independent conditional: 80, 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: 80, independent: 70, independent conditional: 70, 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): 874, Positive cache size: 874, Positive conditional cache size: 874, 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, 147 PlacesBefore, 147 PlacesAfterwards, 957 TransitionsBefore, 957 TransitionsAfterwards, 9244 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): 874, Positive cache size: 874, Positive conditional cache size: 874, 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, 170 PlacesBefore, 169 PlacesAfterwards, 1167 TransitionsBefore, 1166 TransitionsAfterwards, 11068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, 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: 92, independent: 92, independent conditional: 92, 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: 92, independent: 92, independent conditional: 92, 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: 92, independent: 92, independent conditional: 92, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 92, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 896, Positive cache size: 896, Positive conditional cache size: 896, 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: 1.0s, 185 PlacesBefore, 185 PlacesAfterwards, 1294 TransitionsBefore, 1294 TransitionsAfterwards, 12244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 144, 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: 144, independent: 144, independent conditional: 144, 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: 144, independent: 144, independent conditional: 144, 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: 144, independent: 144, independent conditional: 144, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 914, Positive conditional cache size: 914, 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, 194 PlacesBefore, 194 PlacesAfterwards, 1356 TransitionsBefore, 1356 TransitionsAfterwards, 12724 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): 914, Positive cache size: 914, Positive conditional cache size: 914, 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, 211 PlacesBefore, 211 PlacesAfterwards, 1518 TransitionsBefore, 1518 TransitionsAfterwards, 14084 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): 914, Positive cache size: 914, Positive conditional cache size: 914, 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, 225 PlacesBefore, 225 PlacesAfterwards, 1573 TransitionsBefore, 1573 TransitionsAfterwards, 14496 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): 914, Positive cache size: 914, Positive conditional cache size: 914, 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, 244 PlacesBefore, 244 PlacesAfterwards, 1790 TransitionsBefore, 1790 TransitionsAfterwards, 16288 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): 914, Positive cache size: 914, Positive conditional cache size: 914, 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, 270 PlacesBefore, 270 PlacesAfterwards, 2029 TransitionsBefore, 2029 TransitionsAfterwards, 18572 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): 914, Positive cache size: 914, Positive conditional cache size: 914, 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: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 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: 863.4s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 819.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 189 mSolverCounterUnknown, 5152 SdHoareTripleChecker+Valid, 523.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5152 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 518.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5032 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15041 IncrementalHoareTripleChecker+Invalid, 20263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5032 mSolverCounterUnsat, 0 mSDtfsCounter, 15041 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 103.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44324occurred in iteration=25, InterpolantAutomatonStates: 333, 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, 0.7s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 659 ConstructedInterpolants, 140 QuantifiedInterpolants, 14539 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3605 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 73 InterpolantComputations, 3 PerfectInterpolantSequences, 6/202 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