/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:25:23,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:25:23,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:25:23,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:25:23,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:25:23,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:25:23,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:25:23,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:25:23,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:25:23,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:25:23,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:25:23,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:25:23,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:25:23,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:25:23,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:25:23,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:25:23,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:25:23,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:25:23,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:25:23,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:25:23,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:25:23,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:25:23,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:25:23,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:25:23,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:25:23,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:25:23,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:25:23,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:25:23,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:25:23,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:25:23,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:25:23,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:25:23,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:25:23,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:25:23,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:25:23,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:25:23,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:25:23,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:25:23,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:25:23,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:25:23,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:25:23,970 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-06 02:25:24,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:25:24,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:25:24,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:25:24,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:25:24,007 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:25:24,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:25:24,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:25:24,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:25:24,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:25:24,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:25:24,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:25:24,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:25:24,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:25:24,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:25:24,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:25:24,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:25:24,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:25:24,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:25:24,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:25:24,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:25:24,011 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:25:24,011 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:25:24,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:25:24,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:25:24,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:25:24,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:25:24,299 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:25:24,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-12-06 02:25:25,225 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:25:25,441 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:25:25,442 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-12-06 02:25:25,449 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509fce204/cd88a5d9adbc485a85b013e701ad8bca/FLAG61b955bed [2022-12-06 02:25:25,471 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509fce204/cd88a5d9adbc485a85b013e701ad8bca [2022-12-06 02:25:25,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:25:25,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:25:25,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:25:25,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:25:25,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:25:25,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b39c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25, skipping insertion in model container [2022-12-06 02:25:25,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:25:25,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:25:25,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,693 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-12-06 02:25:25,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:25:25,712 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:25:25,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:25,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:25,761 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-12-06 02:25:25,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:25:25,776 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:25:25,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25 WrapperNode [2022-12-06 02:25:25,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:25:25,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:25:25,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:25:25,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:25:25,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,835 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 319 [2022-12-06 02:25:25,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:25:25,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:25:25,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:25:25,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:25:25,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,879 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:25:25,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:25:25,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:25:25,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:25:25,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (1/1) ... [2022-12-06 02:25:25,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:25:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:25:25,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:25:25,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:25:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:25:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:25:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:25:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:25:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:25:25,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:25:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:25:25,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:25:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:25:25,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:25:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:25:25,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:25:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:25:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:25:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:25:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:25:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:25:25,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:25:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:25:25,945 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:25:26,075 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:25:26,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:25:26,480 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:25:26,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:25:26,626 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:25:26,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:25:26 BoogieIcfgContainer [2022-12-06 02:25:26,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:25:26,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:25:26,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:25:26,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:25:26,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:25:25" (1/3) ... [2022-12-06 02:25:26,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5e48d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:25:26, skipping insertion in model container [2022-12-06 02:25:26,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:25" (2/3) ... [2022-12-06 02:25:26,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5e48d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:25:26, skipping insertion in model container [2022-12-06 02:25:26,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:25:26" (3/3) ... [2022-12-06 02:25:26,642 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2022-12-06 02:25:26,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:25:26,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:25:26,657 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:25:26,719 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 02:25:26,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 488 flow [2022-12-06 02:25:26,848 INFO L130 PetriNetUnfolder]: 19/224 cut-off events. [2022-12-06 02:25:26,848 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:25:26,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 224 events. 19/224 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 117 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-12-06 02:25:26,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 488 flow [2022-12-06 02:25:26,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 212 transitions, 448 flow [2022-12-06 02:25:26,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:26,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 212 transitions, 448 flow [2022-12-06 02:25:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 212 transitions, 448 flow [2022-12-06 02:25:26,943 INFO L130 PetriNetUnfolder]: 19/212 cut-off events. [2022-12-06 02:25:26,943 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:25:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 212 events. 19/212 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-12-06 02:25:26,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 212 transitions, 448 flow [2022-12-06 02:25:26,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 2000 [2022-12-06 02:25:36,367 INFO L203 LiptonReduction]: Total number of compositions: 175 [2022-12-06 02:25:36,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:25:36,385 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;@4c8b87c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:25:36,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 02:25:36,391 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-06 02:25:36,392 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:25:36,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:36,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:25:36,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:25:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1615622546, now seen corresponding path program 1 times [2022-12-06 02:25:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:36,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203380911] [2022-12-06 02:25:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:37,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203380911] [2022-12-06 02:25:37,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203380911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:25:37,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:25:37,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:25:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519128549] [2022-12-06 02:25:37,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:25:37,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:25:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:25:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:25:37,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 02:25:37,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-06 02:25:37,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:37,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 02:25:37,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:25:37,783 INFO L130 PetriNetUnfolder]: 4116/5443 cut-off events. [2022-12-06 02:25:37,783 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2022-12-06 02:25:37,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11309 conditions, 5443 events. 4116/5443 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 25196 event pairs, 578 based on Foata normal form. 0/4058 useless extension candidates. Maximal degree in co-relation 9951. Up to 2391 conditions per place. [2022-12-06 02:25:37,816 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 75 selfloop transitions, 6 changer transitions 8/92 dead transitions. [2022-12-06 02:25:37,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 419 flow [2022-12-06 02:25:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:25:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:25:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 02:25:37,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2022-12-06 02:25:37,829 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-12-06 02:25:37,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:37,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 92 transitions, 419 flow [2022-12-06 02:25:37,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 92 transitions, 419 flow [2022-12-06 02:25:37,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 02:25:38,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:25:38,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347 [2022-12-06 02:25:38,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 92 transitions, 419 flow [2022-12-06 02:25:38,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-06 02:25:38,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:38,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:25:38,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:25:38,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:25:38,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2087954736, now seen corresponding path program 1 times [2022-12-06 02:25:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:38,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432950715] [2022-12-06 02:25:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432950715] [2022-12-06 02:25:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432950715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:25:38,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:25:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:25:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609421797] [2022-12-06 02:25:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:25:38,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:25:38,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:25:38,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:25:38,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-06 02:25:38,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 92 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:38,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:38,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-06 02:25:38,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:25:39,066 INFO L130 PetriNetUnfolder]: 6996/9274 cut-off events. [2022-12-06 02:25:39,066 INFO L131 PetriNetUnfolder]: For 1746/1766 co-relation queries the response was YES. [2022-12-06 02:25:39,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27000 conditions, 9274 events. 6996/9274 cut-off events. For 1746/1766 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 44796 event pairs, 1311 based on Foata normal form. 320/7190 useless extension candidates. Maximal degree in co-relation 16347. Up to 6046 conditions per place. [2022-12-06 02:25:39,113 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 73 selfloop transitions, 2 changer transitions 75/160 dead transitions. [2022-12-06 02:25:39,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 160 transitions, 1045 flow [2022-12-06 02:25:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:25:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:25:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 02:25:39,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 02:25:39,115 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-12-06 02:25:39,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:39,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 160 transitions, 1045 flow [2022-12-06 02:25:39,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 160 transitions, 1045 flow [2022-12-06 02:25:39,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-06 02:25:44,209 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:25:44,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5095 [2022-12-06 02:25:44,210 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 159 transitions, 1039 flow [2022-12-06 02:25:44,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:44,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:44,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:25:44,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:25:44,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:25:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1456281299, now seen corresponding path program 1 times [2022-12-06 02:25:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:44,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899135870] [2022-12-06 02:25:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:44,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899135870] [2022-12-06 02:25:44,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899135870] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:25:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539268771] [2022-12-06 02:25:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:25:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:25:44,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:25:44,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:25:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:44,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:25:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:25:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:44,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:25:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:44,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539268771] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:25:44,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:25:44,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2022-12-06 02:25:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769368390] [2022-12-06 02:25:44,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:25:44,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:25:44,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:44,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:25:44,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:25:44,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 02:25:44,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 159 transitions, 1039 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:44,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:44,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 02:25:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:25:46,311 INFO L130 PetriNetUnfolder]: 11337/14836 cut-off events. [2022-12-06 02:25:46,312 INFO L131 PetriNetUnfolder]: For 3404/3489 co-relation queries the response was YES. [2022-12-06 02:25:46,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58557 conditions, 14836 events. 11337/14836 cut-off events. For 3404/3489 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 75536 event pairs, 201 based on Foata normal form. 12/10879 useless extension candidates. Maximal degree in co-relation 48134. Up to 11260 conditions per place. [2022-12-06 02:25:46,407 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 236 selfloop transitions, 26 changer transitions 107/372 dead transitions. [2022-12-06 02:25:46,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 372 transitions, 3161 flow [2022-12-06 02:25:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:25:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:25:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-12-06 02:25:46,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49477351916376305 [2022-12-06 02:25:46,409 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-12-06 02:25:46,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:46,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 372 transitions, 3161 flow [2022-12-06 02:25:46,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 372 transitions, 3161 flow [2022-12-06 02:25:46,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 1360 [2022-12-06 02:25:46,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:25:46,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 556 [2022-12-06 02:25:46,965 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 372 transitions, 3161 flow [2022-12-06 02:25:46,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:46,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:46,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:25:46,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:25:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:25:47,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:25:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 399519118, now seen corresponding path program 1 times [2022-12-06 02:25:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:47,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242285335] [2022-12-06 02:25:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:47,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:47,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242285335] [2022-12-06 02:25:47,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242285335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:25:47,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893996908] [2022-12-06 02:25:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:47,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:25:47,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:25:47,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:25:47,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:25:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:47,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 02:25:47,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:25:47,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:25:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:47,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:25:48,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:25:48,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-12-06 02:25:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:48,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893996908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:25:48,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:25:48,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-12-06 02:25:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877110804] [2022-12-06 02:25:48,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:25:48,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:25:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:48,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:25:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:25:48,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 45 [2022-12-06 02:25:48,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 372 transitions, 3161 flow. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:48,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:48,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 45 [2022-12-06 02:25:48,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:25:51,386 INFO L130 PetriNetUnfolder]: 25116/32522 cut-off events. [2022-12-06 02:25:51,387 INFO L131 PetriNetUnfolder]: For 8218/8582 co-relation queries the response was YES. [2022-12-06 02:25:51,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161228 conditions, 32522 events. 25116/32522 cut-off events. For 8218/8582 co-relation queries the response was YES. Maximal size of possible extension queue 1435. Compared 172695 event pairs, 494 based on Foata normal form. 289/23976 useless extension candidates. Maximal degree in co-relation 102837. Up to 26788 conditions per place. [2022-12-06 02:25:51,627 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 877 selfloop transitions, 134 changer transitions 222/1240 dead transitions. [2022-12-06 02:25:51,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 1240 transitions, 13000 flow [2022-12-06 02:25:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:25:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:25:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 307 transitions. [2022-12-06 02:25:51,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5247863247863248 [2022-12-06 02:25:51,633 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2022-12-06 02:25:51,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:51,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 1240 transitions, 13000 flow [2022-12-06 02:25:51,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 1240 transitions, 13000 flow [2022-12-06 02:25:51,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 3442 [2022-12-06 02:25:52,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:25:52,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 833 [2022-12-06 02:25:52,466 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 1240 transitions, 13000 flow [2022-12-06 02:25:52,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:52,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:25:52,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:25:52,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:25:52,670 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,SelfDestructingSolverStorable3 [2022-12-06 02:25:52,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:25:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:25:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1381109722, now seen corresponding path program 2 times [2022-12-06 02:25:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:25:52,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042513664] [2022-12-06 02:25:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:25:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:25:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:25:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:25:53,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042513664] [2022-12-06 02:25:53,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042513664] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:25:53,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495653110] [2022-12-06 02:25:53,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:25:53,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:25:53,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:25:53,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:25:53,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:25:54,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:25:54,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:25:54,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 02:25:54,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:25:54,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:25:54,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:25:54,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:25:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:54,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:25:54,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:25:54,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-12-06 02:25:54,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-06 02:25:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:25:54,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495653110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:25:54,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:25:54,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 02:25:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911163218] [2022-12-06 02:25:54,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:25:54,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:25:54,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:25:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:25:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:25:54,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-06 02:25:54,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 1240 transitions, 13000 flow. Second operand has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:25:54,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:25:54,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-06 02:25:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:08,018 INFO L130 PetriNetUnfolder]: 64455/84360 cut-off events. [2022-12-06 02:26:08,018 INFO L131 PetriNetUnfolder]: For 20080/20916 co-relation queries the response was YES. [2022-12-06 02:26:08,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503143 conditions, 84360 events. 64455/84360 cut-off events. For 20080/20916 co-relation queries the response was YES. Maximal size of possible extension queue 3624. Compared 516722 event pairs, 1396 based on Foata normal form. 1465/62763 useless extension candidates. Maximal degree in co-relation 152012. Up to 74027 conditions per place. [2022-12-06 02:26:08,624 INFO L137 encePairwiseOnDemand]: 29/50 looper letters, 2606 selfloop transitions, 302 changer transitions 315/3230 dead transitions. [2022-12-06 02:26:08,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 3230 transitions, 40354 flow [2022-12-06 02:26:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:26:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:26:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 675 transitions. [2022-12-06 02:26:08,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2022-12-06 02:26:08,628 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2022-12-06 02:26:08,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:08,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 3230 transitions, 40354 flow [2022-12-06 02:26:09,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 3230 transitions, 40354 flow [2022-12-06 02:26:09,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 8388 [2022-12-06 02:26:28,903 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 02:26:28,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20276 [2022-12-06 02:26:28,904 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 3226 transitions, 40306 flow [2022-12-06 02:26:28,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:28,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:28,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:28,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:26:29,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:29,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1533575327, now seen corresponding path program 1 times [2022-12-06 02:26:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:29,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644208471] [2022-12-06 02:26:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:30,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644208471] [2022-12-06 02:26:30,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644208471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:26:30,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16900709] [2022-12-06 02:26:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:30,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:26:30,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:26:30,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:26:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:30,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 02:26:30,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:26:30,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:26:30,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:26:30,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:26:30,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:26:30,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:26:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:30,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:26:30,869 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_331) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-12-06 02:26:32,886 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_331) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:26:32,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:26:32,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 162 [2022-12-06 02:26:32,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-12-06 02:26:32,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2022-12-06 02:26:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:26:33,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16900709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:26:33,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:26:33,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 02:26:33,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265019580] [2022-12-06 02:26:33,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:26:33,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:26:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:26:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=194, Unknown=2, NotChecked=58, Total=306 [2022-12-06 02:26:33,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2022-12-06 02:26:33,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 3226 transitions, 40306 flow. Second operand has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:33,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:33,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2022-12-06 02:26:33,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:57,710 INFO L130 PetriNetUnfolder]: 80586/105395 cut-off events. [2022-12-06 02:26:57,711 INFO L131 PetriNetUnfolder]: For 28086/29080 co-relation queries the response was YES. [2022-12-06 02:26:57,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733936 conditions, 105395 events. 80586/105395 cut-off events. For 28086/29080 co-relation queries the response was YES. Maximal size of possible extension queue 4564. Compared 662811 event pairs, 1965 based on Foata normal form. 32/76592 useless extension candidates. Maximal degree in co-relation 195224. Up to 93197 conditions per place. [2022-12-06 02:26:58,522 INFO L137 encePairwiseOnDemand]: 32/54 looper letters, 3391 selfloop transitions, 259 changer transitions 337/3994 dead transitions. [2022-12-06 02:26:58,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 3994 transitions, 57899 flow [2022-12-06 02:26:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:26:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:26:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2022-12-06 02:26:58,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-06 02:26:58,524 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2022-12-06 02:26:58,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:58,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 3994 transitions, 57899 flow [2022-12-06 02:26:59,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 3994 transitions, 57899 flow [2022-12-06 02:26:59,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 10526 [2022-12-06 02:26:59,328 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:26:59,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 805 [2022-12-06 02:26:59,329 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 3994 transitions, 57899 flow [2022-12-06 02:26:59,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:59,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:59,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:59,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:26:59,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:59,535 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:59,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2035897694, now seen corresponding path program 1 times [2022-12-06 02:26:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:59,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076659790] [2022-12-06 02:26:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:00,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076659790] [2022-12-06 02:27:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076659790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:00,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435712255] [2022-12-06 02:27:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:00,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:00,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:00,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:27:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:00,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 02:27:00,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:00,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 826 treesize of output 822 [2022-12-06 02:27:00,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:27:00,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:27:00,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:27:00,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:00,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:27:00,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:00,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:27:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:00,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:27:00,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:27:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:00,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:01,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_425 (Array Int Int)) (~q1_back~0 Int) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_422)) (.cse1 (+ (* ~q1_back~0 4) c_~q1~0.offset))) (or (< 0 (+ (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_425) c_~q1~0.base) .cse1) c_~total~0)) (not (< ~q1_back~0 c_~n1~0)) (< (select (select .cse0 c_~q1~0.base) .cse1) 1) (not (<= 0 ~q1_back~0))))) is different from false [2022-12-06 02:27:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:01,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435712255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:01,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:01,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-06 02:27:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469894271] [2022-12-06 02:27:01,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:01,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:27:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:27:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=4, NotChecked=32, Total=342 [2022-12-06 02:27:01,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2022-12-06 02:27:01,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 3994 transitions, 57899 flow. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:01,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:01,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2022-12-06 02:27:01,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:34,703 INFO L130 PetriNetUnfolder]: 84423/110678 cut-off events. [2022-12-06 02:27:34,703 INFO L131 PetriNetUnfolder]: For 33688/34548 co-relation queries the response was YES. [2022-12-06 02:27:34,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880137 conditions, 110678 events. 84423/110678 cut-off events. For 33688/34548 co-relation queries the response was YES. Maximal size of possible extension queue 4679. Compared 700492 event pairs, 1996 based on Foata normal form. 384/80767 useless extension candidates. Maximal degree in co-relation 244718. Up to 97311 conditions per place. [2022-12-06 02:27:35,580 INFO L137 encePairwiseOnDemand]: 36/54 looper letters, 3680 selfloop transitions, 252 changer transitions 426/4365 dead transitions. [2022-12-06 02:27:35,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 4365 transitions, 71952 flow [2022-12-06 02:27:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:27:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:27:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2022-12-06 02:27:35,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-06 02:27:35,582 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places. [2022-12-06 02:27:35,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:35,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 4365 transitions, 71952 flow [2022-12-06 02:27:36,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 4365 transitions, 71952 flow [2022-12-06 02:27:36,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 10852 [2022-12-06 02:27:43,257 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:27:43,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7675 [2022-12-06 02:27:43,257 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 4364 transitions, 71936 flow [2022-12-06 02:27:43,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:43,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:43,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:43,265 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-06 02:27:43,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:43,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:27:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash -62558102, now seen corresponding path program 1 times [2022-12-06 02:27:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:43,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074840486] [2022-12-06 02:27:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:27:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:43,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074840486] [2022-12-06 02:27:43,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074840486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:43,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:43,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:27:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094595467] [2022-12-06 02:27:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:43,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:27:43,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:27:43,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:27:43,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 56 [2022-12-06 02:27:43,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 4364 transitions, 71936 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:43,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:43,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 56 [2022-12-06 02:27:43,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:12,268 INFO L130 PetriNetUnfolder]: 68378/90281 cut-off events. [2022-12-06 02:28:12,269 INFO L131 PetriNetUnfolder]: For 51952/52600 co-relation queries the response was YES. [2022-12-06 02:28:12,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800386 conditions, 90281 events. 68378/90281 cut-off events. For 51952/52600 co-relation queries the response was YES. Maximal size of possible extension queue 3876. Compared 570565 event pairs, 1637 based on Foata normal form. 7/66890 useless extension candidates. Maximal degree in co-relation 339410. Up to 79874 conditions per place. [2022-12-06 02:28:12,987 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 2914 selfloop transitions, 0 changer transitions 943/3962 dead transitions. [2022-12-06 02:28:12,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 3962 transitions, 73074 flow [2022-12-06 02:28:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:28:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:28:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-12-06 02:28:12,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 02:28:12,988 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2022-12-06 02:28:12,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:12,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 3962 transitions, 73074 flow [2022-12-06 02:28:13,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 3962 transitions, 73074 flow [2022-12-06 02:28:13,605 INFO L188 LiptonReduction]: Number of co-enabled transitions 9848 [2022-12-06 02:28:13,643 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:13,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 656 [2022-12-06 02:28:13,644 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 3962 transitions, 73074 flow [2022-12-06 02:28:13,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:13,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:13,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:13,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:28:13,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:28:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1745262105, now seen corresponding path program 2 times [2022-12-06 02:28:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:13,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756412442] [2022-12-06 02:28:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756412442] [2022-12-06 02:28:14,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756412442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:14,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190430506] [2022-12-06 02:28:14,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:28:14,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:14,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:14,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:14,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:28:14,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:28:14,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:14,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 02:28:14,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:14,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-06 02:28:14,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:15,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:15,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:15,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:28:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:15,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:15,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_547) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:28:17,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:17,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 168 [2022-12-06 02:28:17,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2022-12-06 02:28:17,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-12-06 02:28:17,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-12-06 02:28:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:19,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190430506] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:19,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:19,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-06 02:28:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131625964] [2022-12-06 02:28:19,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:19,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:28:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:19,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:28:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=238, Unknown=11, NotChecked=32, Total=342 [2022-12-06 02:28:19,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2022-12-06 02:28:19,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 3962 transitions, 73074 flow. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:19,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:19,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2022-12-06 02:28:19,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:54,310 INFO L130 PetriNetUnfolder]: 77577/102436 cut-off events. [2022-12-06 02:28:54,311 INFO L131 PetriNetUnfolder]: For 68383/69591 co-relation queries the response was YES. [2022-12-06 02:28:54,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010107 conditions, 102436 events. 77577/102436 cut-off events. For 68383/69591 co-relation queries the response was YES. Maximal size of possible extension queue 4481. Compared 657929 event pairs, 1859 based on Foata normal form. 17/75909 useless extension candidates. Maximal degree in co-relation 396122. Up to 91034 conditions per place. [2022-12-06 02:28:55,162 INFO L137 encePairwiseOnDemand]: 32/54 looper letters, 3191 selfloop transitions, 278 changer transitions 1090/4565 dead transitions. [2022-12-06 02:28:55,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 4565 transitions, 93396 flow [2022-12-06 02:28:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:28:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:28:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2022-12-06 02:28:55,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2022-12-06 02:28:55,164 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2022-12-06 02:28:55,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:55,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 4565 transitions, 93396 flow [2022-12-06 02:28:56,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 4565 transitions, 93396 flow [2022-12-06 02:28:56,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 11536 [2022-12-06 02:28:56,041 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:56,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 878 [2022-12-06 02:28:56,042 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 4565 transitions, 93396 flow [2022-12-06 02:28:56,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 19 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:56,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:56,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:56,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:56,245 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:28:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1826354162, now seen corresponding path program 1 times [2022-12-06 02:28:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:56,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160959628] [2022-12-06 02:28:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:56,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:56,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160959628] [2022-12-06 02:28:56,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160959628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:56,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:56,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:28:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498146180] [2022-12-06 02:28:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:28:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:28:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:28:56,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2022-12-06 02:28:56,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 4565 transitions, 93396 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:56,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:56,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2022-12-06 02:28:56,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:51,649 INFO L130 PetriNetUnfolder]: 105830/143329 cut-off events. [2022-12-06 02:29:51,650 INFO L131 PetriNetUnfolder]: For 231600/234909 co-relation queries the response was YES. [2022-12-06 02:29:52,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477173 conditions, 143329 events. 105830/143329 cut-off events. For 231600/234909 co-relation queries the response was YES. Maximal size of possible extension queue 5617. Compared 982594 event pairs, 6432 based on Foata normal form. 42/112935 useless extension candidates. Maximal degree in co-relation 483150. Up to 119980 conditions per place. [2022-12-06 02:29:52,958 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 5238 selfloop transitions, 205 changer transitions 1534/7092 dead transitions. [2022-12-06 02:29:52,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 7092 transitions, 159582 flow [2022-12-06 02:29:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:29:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:29:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-12-06 02:29:52,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-06 02:29:52,960 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 71 predicate places. [2022-12-06 02:29:52,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:52,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 7092 transitions, 159582 flow [2022-12-06 02:29:53,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 7092 transitions, 159582 flow [2022-12-06 02:29:53,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 5248 [2022-12-06 02:29:54,032 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:54,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1072 [2022-12-06 02:29:54,032 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 7092 transitions, 159582 flow [2022-12-06 02:29:54,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:54,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:54,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:54,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 02:29:54,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:29:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -85768128, now seen corresponding path program 1 times [2022-12-06 02:29:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:54,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343763255] [2022-12-06 02:29:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343763255] [2022-12-06 02:29:55,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343763255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099350013] [2022-12-06 02:29:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:55,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:55,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:29:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:55,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 02:29:55,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:55,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:29:55,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:29:55,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:29:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:55,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:55,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_657) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:29:55,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:55,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-12-06 02:29:55,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-06 02:29:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:29:55,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099350013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:55,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:55,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 02:29:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99182071] [2022-12-06 02:29:55,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:55,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:29:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:29:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2022-12-06 02:29:55,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2022-12-06 02:29:55,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 7092 transitions, 159582 flow. Second operand has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:55,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:55,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2022-12-06 02:29:55,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:21,739 INFO L130 PetriNetUnfolder]: 122640/166311 cut-off events. [2022-12-06 02:32:21,739 INFO L131 PetriNetUnfolder]: For 314768/319297 co-relation queries the response was YES. [2022-12-06 02:32:22,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867616 conditions, 166311 events. 122640/166311 cut-off events. For 314768/319297 co-relation queries the response was YES. Maximal size of possible extension queue 6579. Compared 1165662 event pairs, 7368 based on Foata normal form. 69/131461 useless extension candidates. Maximal degree in co-relation 526765. Up to 138302 conditions per place. [2022-12-06 02:32:23,234 INFO L137 encePairwiseOnDemand]: 28/54 looper letters, 6028 selfloop transitions, 459 changer transitions 1896/8390 dead transitions. [2022-12-06 02:32:23,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 8390 transitions, 205622 flow [2022-12-06 02:32:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:32:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:32:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 377 transitions. [2022-12-06 02:32:23,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4106753812636166 [2022-12-06 02:32:23,237 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places. [2022-12-06 02:32:23,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:23,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 8390 transitions, 205622 flow [2022-12-06 02:32:24,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 8390 transitions, 205622 flow [2022-12-06 02:32:24,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 6310 [2022-12-06 02:32:31,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:32:31,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8614 [2022-12-06 02:32:31,851 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 8389 transitions, 205598 flow [2022-12-06 02:32:31,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 19 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:31,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:31,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:31,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 02:32:32,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:32,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:32:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1356764, now seen corresponding path program 1 times [2022-12-06 02:32:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:32,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443679182] [2022-12-06 02:32:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:33,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443679182] [2022-12-06 02:32:33,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443679182] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:33,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6950980] [2022-12-06 02:32:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:33,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:33,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:33,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:32:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:33,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 02:32:33,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:33,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:33,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:32:33,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:33,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:32:33,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:32:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:33,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:33,674 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_737 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_737) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:32:33,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:32:33,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 84 [2022-12-06 02:32:33,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-12-06 02:32:33,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-06 02:32:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:35,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6950980] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:35,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:35,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-06 02:32:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433785290] [2022-12-06 02:32:35,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:32:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:32:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=279, Unknown=8, NotChecked=34, Total=380 [2022-12-06 02:32:35,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 55 [2022-12-06 02:32:35,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 8389 transitions, 205598 flow. Second operand has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:35,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:35,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 55 [2022-12-06 02:32:35,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:36:28,632 INFO L130 PetriNetUnfolder]: 164295/222132 cut-off events. [2022-12-06 02:36:28,633 INFO L131 PetriNetUnfolder]: For 435652/441008 co-relation queries the response was YES. [2022-12-06 02:36:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704019 conditions, 222132 events. 164295/222132 cut-off events. For 435652/441008 co-relation queries the response was YES. Maximal size of possible extension queue 8624. Compared 1592937 event pairs, 9025 based on Foata normal form. 153/174797 useless extension candidates. Maximal degree in co-relation 637320. Up to 184955 conditions per place. [2022-12-06 02:36:30,882 INFO L137 encePairwiseOnDemand]: 26/55 looper letters, 8112 selfloop transitions, 645 changer transitions 2222/10986 dead transitions. [2022-12-06 02:36:30,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 10986 transitions, 291226 flow [2022-12-06 02:36:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:36:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:36:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 379 transitions. [2022-12-06 02:36:30,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4053475935828877 [2022-12-06 02:36:30,884 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 102 predicate places. [2022-12-06 02:36:30,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:36:30,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 10986 transitions, 291226 flow [2022-12-06 02:36:32,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 10986 transitions, 291226 flow [2022-12-06 02:36:32,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 8168 [2022-12-06 02:36:32,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:36:32,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1942 [2022-12-06 02:36:32,826 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 10986 transitions, 291226 flow [2022-12-06 02:36:32,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:36:32,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:36:32,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:36:32,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 02:36:33,031 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,SelfDestructingSolverStorable11 [2022-12-06 02:36:33,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:36:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:36:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1051319212, now seen corresponding path program 2 times [2022-12-06 02:36:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:36:33,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90039298] [2022-12-06 02:36:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:36:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:36:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:36:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:36:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:36:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90039298] [2022-12-06 02:36:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90039298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:36:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662418117] [2022-12-06 02:36:34,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:36:34,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:36:34,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:36:34,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:36:34,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:36:34,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:36:34,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:36:34,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 02:36:34,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:36:34,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:36:34,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 02:36:34,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:36:34,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:36:34,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:36:34,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:36:34,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:36:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:36:34,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:36:39,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_822 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_821) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_822) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:36:39,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:36:39,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 330 [2022-12-06 02:36:39,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 290 [2022-12-06 02:36:39,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2022-12-06 02:36:39,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 230 [2022-12-06 02:36:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:36:39,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662418117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:36:39,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:36:39,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-06 02:36:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867208294] [2022-12-06 02:36:39,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:36:39,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:36:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:36:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:36:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=345, Unknown=8, NotChecked=38, Total=462 [2022-12-06 02:36:39,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 55 [2022-12-06 02:36:39,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 10986 transitions, 291226 flow. Second operand has 22 states, 22 states have (on average 7.2272727272727275) internal successors, (159), 22 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:36:39,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:36:39,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 55 [2022-12-06 02:36:39,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:38:34,339 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:38:34,339 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:38:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:38:34,506 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 02:38:34,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:34,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:38:34,706 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/55 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 891571 conditions, 68133 events (50239/68132 cut-off events. For 333961/339443 co-relation queries the response was YES. Maximal size of possible extension queue 8457. Compared 512708 event pairs, 3117 based on Foata normal form. 168/61177 useless extension candidates. Maximal degree in co-relation 323800. Up to 54545 conditions per place.). [2022-12-06 02:38:34,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 02:38:34,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 02:38:34,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 02:38:34,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 02:38:34,708 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:34,710 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:38:34,710 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:38:34,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:38:34 BasicIcfg [2022-12-06 02:38:34,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:38:34,712 INFO L158 Benchmark]: Toolchain (without parser) took 789237.83ms. Allocated memory was 186.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 162.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 6.5GB. Max. memory is 8.0GB. [2022-12-06 02:38:34,713 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 164.3MB in the beginning and 164.2MB in the end (delta: 84.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:38:34,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.94ms. Allocated memory is still 186.6MB. Free memory was 162.6MB in the beginning and 146.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 02:38:34,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.00ms. Allocated memory is still 186.6MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:38:34,715 INFO L158 Benchmark]: Boogie Preprocessor took 46.79ms. Allocated memory is still 186.6MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:38:34,716 INFO L158 Benchmark]: RCFGBuilder took 751.39ms. Allocated memory is still 186.6MB. Free memory was 141.8MB in the beginning and 146.4MB in the end (delta: -4.6MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2022-12-06 02:38:34,716 INFO L158 Benchmark]: TraceAbstraction took 788075.64ms. Allocated memory was 186.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 145.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 6.5GB. Max. memory is 8.0GB. [2022-12-06 02:38:34,717 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 164.3MB in the beginning and 164.2MB in the end (delta: 84.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.94ms. Allocated memory is still 186.6MB. Free memory was 162.6MB in the beginning and 146.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.00ms. Allocated memory is still 186.6MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.79ms. Allocated memory is still 186.6MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 751.39ms. Allocated memory is still 186.6MB. Free memory was 141.8MB in the beginning and 146.4MB in the end (delta: -4.6MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. * TraceAbstraction took 788075.64ms. Allocated memory was 186.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 145.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 6.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 206 PlacesBefore, 44 PlacesAfterwards, 212 TransitionsBefore, 37 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 31 ConcurrentYvCompositions, 13 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1090, independent: 1064, independent conditional: 1064, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1090, independent: 1064, independent conditional: 0, independent unconditional: 1064, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1090, independent: 1064, independent conditional: 0, independent unconditional: 1064, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1090, independent: 1064, independent conditional: 0, independent unconditional: 1064, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 980, independent: 964, independent conditional: 0, independent unconditional: 964, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 980, independent: 961, independent conditional: 0, independent unconditional: 961, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1090, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 980, unknown conditional: 0, unknown unconditional: 980] , Statistics on independence cache: Total cache size (in pairs): 1467, Positive cache size: 1451, Positive conditional cache size: 0, Positive unconditional cache size: 1451, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 49 PlacesBefore, 49 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 53 PlacesBefore, 52 PlacesAfterwards, 160 TransitionsBefore, 159 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 58 PlacesBefore, 58 PlacesAfterwards, 372 TransitionsBefore, 372 TransitionsAfterwards, 1360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 70 PlacesBefore, 70 PlacesAfterwards, 1240 TransitionsBefore, 1240 TransitionsAfterwards, 3442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.6s, 98 PlacesBefore, 93 PlacesAfterwards, 3230 TransitionsBefore, 3226 TransitionsAfterwards, 8388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 3994 TransitionsBefore, 3994 TransitionsAfterwards, 10526 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: 6.8s, 108 PlacesBefore, 107 PlacesAfterwards, 4365 TransitionsBefore, 4364 TransitionsAfterwards, 10852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 3962 TransitionsBefore, 3962 TransitionsAfterwards, 9848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 4565 TransitionsBefore, 4565 TransitionsAfterwards, 11536 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.1s, 115 PlacesBefore, 115 PlacesAfterwards, 7092 TransitionsBefore, 7092 TransitionsAfterwards, 5248 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: 7.3s, 131 PlacesBefore, 130 PlacesAfterwards, 8390 TransitionsBefore, 8389 TransitionsAfterwards, 6310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 146 PlacesBefore, 146 PlacesAfterwards, 10986 TransitionsBefore, 10986 TransitionsAfterwards, 8168 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 - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/55 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 891571 conditions, 68133 events (50239/68132 cut-off events. For 333961/339443 co-relation queries the response was YES. Maximal size of possible extension queue 8457. Compared 512708 event pairs, 3117 based on Foata normal form. 168/61177 useless extension candidates. Maximal degree in co-relation 323800. Up to 54545 conditions per place.). - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/55 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 891571 conditions, 68133 events (50239/68132 cut-off events. For 333961/339443 co-relation queries the response was YES. Maximal size of possible extension queue 8457. Compared 512708 event pairs, 3117 based on Foata normal form. 168/61177 useless extension candidates. Maximal degree in co-relation 323800. Up to 54545 conditions per place.). - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/55 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 891571 conditions, 68133 events (50239/68132 cut-off events. For 333961/339443 co-relation queries the response was YES. Maximal size of possible extension queue 8457. Compared 512708 event pairs, 3117 based on Foata normal form. 168/61177 useless extension candidates. Maximal degree in co-relation 323800. Up to 54545 conditions per place.). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/55 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 891571 conditions, 68133 events (50239/68132 cut-off events. For 333961/339443 co-relation queries the response was YES. Maximal size of possible extension queue 8457. Compared 512708 event pairs, 3117 based on Foata normal form. 168/61177 useless extension candidates. Maximal degree in co-relation 323800. Up to 54545 conditions per place.). - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 4/55 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 891571 conditions, 68133 events (50239/68132 cut-off events. For 333961/339443 co-relation queries the response was YES. Maximal size of possible extension queue 8457. Compared 512708 event pairs, 3117 based on Foata normal form. 168/61177 useless extension candidates. Maximal degree in co-relation 323800. Up to 54545 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 244 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 788.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 700.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3696 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3696 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 829 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 507 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8813 IncrementalHoareTripleChecker+Invalid, 10150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 507 mSolverCounterUnsat, 7 mSDtfsCounter, 8813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 457 SyntacticMatches, 19 SemanticMatches, 226 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291226occurred in iteration=12, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 902 ConstructedInterpolants, 44 QuantifiedInterpolants, 21004 SizeOfPredicates, 236 NumberOfNonLiveVariables, 3146 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 10/58 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