/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:39:22,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:39:22,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:39:22,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:39:22,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:39:22,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:39:22,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:39:22,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:39:22,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:39:22,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:39:22,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:39:22,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:39:22,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:39:22,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:39:22,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:39:22,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:39:22,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:39:22,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:39:22,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:39:22,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:39:22,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:39:22,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:39:22,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:39:22,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:39:22,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:39:22,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:39:22,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:39:22,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:39:22,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:39:22,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:39:22,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:39:22,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:39:22,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:39:22,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:39:22,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:39:22,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:39:22,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:39:22,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:39:22,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:39:22,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:39:22,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:39:22,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 08:39:22,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:39:22,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:39:22,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:39:22,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:39:22,802 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:39:22,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:39:22,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:39:22,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:39:22,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:39:22,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:39:22,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:39:22,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:39:22,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:39:22,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:39:22,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:39:22,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:39:22,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:39:22,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:39:22,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:39:22,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:39:22,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:39:22,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:39:22,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:39:22,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:39:22,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:39:22,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:39:22,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:39:22,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:39:22,807 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 08:39:23,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:39:23,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:39:23,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:39:23,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:39:23,166 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:39:23,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2022-12-13 08:39:24,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:39:24,419 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:39:24,420 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2022-12-13 08:39:24,425 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be7d0eed/8d3f0841790a44d6adcbf7c319c9bc95/FLAG5a01d6861 [2022-12-13 08:39:24,437 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be7d0eed/8d3f0841790a44d6adcbf7c319c9bc95 [2022-12-13 08:39:24,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:39:24,441 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:39:24,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:39:24,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:39:24,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:39:24,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a2e729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24, skipping insertion in model container [2022-12-13 08:39:24,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:39:24,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:39:24,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,645 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/test-hard1.wvr.c[3373,3386] [2022-12-13 08:39:24,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:39:24,661 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:39:24,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:39:24,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:39:24,689 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/test-hard1.wvr.c[3373,3386] [2022-12-13 08:39:24,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:39:24,702 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:39:24,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24 WrapperNode [2022-12-13 08:39:24,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:39:24,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:39:24,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:39:24,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:39:24,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,737 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2022-12-13 08:39:24,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:39:24,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:39:24,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:39:24,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:39:24,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,759 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:39:24,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:39:24,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:39:24,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:39:24,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (1/1) ... [2022-12-13 08:39:24,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:39:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:39:24,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 08:39:24,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 08:39:24,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:39:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:39:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:39:24,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:39:24,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:39:24,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 08:39:24,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 08:39:24,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 08:39:24,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 08:39:24,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:39:24,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:39:24,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:39:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 08:39:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 08:39:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:39:24,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:39:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:39:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:39:24,842 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 08:39:24,951 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:39:24,952 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:39:25,246 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:39:25,302 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:39:25,302 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 08:39:25,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:39:25 BoogieIcfgContainer [2022-12-13 08:39:25,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:39:25,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:39:25,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:39:25,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:39:25,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:39:24" (1/3) ... [2022-12-13 08:39:25,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c677b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:39:25, skipping insertion in model container [2022-12-13 08:39:25,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:24" (2/3) ... [2022-12-13 08:39:25,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c677b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:39:25, skipping insertion in model container [2022-12-13 08:39:25,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:39:25" (3/3) ... [2022-12-13 08:39:25,312 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2022-12-13 08:39:25,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:39:25,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:39:25,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:39:25,436 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 08:39:25,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 128 transitions, 288 flow [2022-12-13 08:39:25,568 INFO L130 PetriNetUnfolder]: 10/124 cut-off events. [2022-12-13 08:39:25,568 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 08:39:25,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 124 events. 10/124 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 08:39:25,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 128 transitions, 288 flow [2022-12-13 08:39:25,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 112 transitions, 248 flow [2022-12-13 08:39:25,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:25,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 112 transitions, 248 flow [2022-12-13 08:39:25,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 112 transitions, 248 flow [2022-12-13 08:39:25,660 INFO L130 PetriNetUnfolder]: 10/112 cut-off events. [2022-12-13 08:39:25,660 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 08:39:25,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 112 events. 10/112 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 08:39:25,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 112 transitions, 248 flow [2022-12-13 08:39:25,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-13 08:39:29,939 INFO L241 LiptonReduction]: Total number of compositions: 79 [2022-12-13 08:39:29,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:39:29,960 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;@4e597f73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:39:29,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 08:39:29,971 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-13 08:39:29,972 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 08:39:29,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:29,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:29,973 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-13 08:39:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1819005729, now seen corresponding path program 1 times [2022-12-13 08:39:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:29,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918139314] [2022-12-13 08:39:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:30,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918139314] [2022-12-13 08:39:30,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918139314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:30,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:30,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 08:39:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741047548] [2022-12-13 08:39:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:30,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:39:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:30,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:39:30,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:39:30,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 08:39:30,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:30,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:30,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 08:39:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:30,990 INFO L130 PetriNetUnfolder]: 1537/2184 cut-off events. [2022-12-13 08:39:30,991 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 08:39:30,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4286 conditions, 2184 events. 1537/2184 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9202 event pairs, 141 based on Foata normal form. 1/1355 useless extension candidates. Maximal degree in co-relation 3271. Up to 1733 conditions per place. [2022-12-13 08:39:31,010 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-12-13 08:39:31,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 249 flow [2022-12-13 08:39:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:39:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:39:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 08:39:31,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 08:39:31,024 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 08:39:31,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 55 transitions, 249 flow [2022-12-13 08:39:31,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 54 transitions, 242 flow [2022-12-13 08:39:31,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:31,051 INFO L89 Accepts]: Start accepts. Operand has 44 places, 54 transitions, 242 flow [2022-12-13 08:39:31,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:31,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:31,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 54 transitions, 242 flow [2022-12-13 08:39:31,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 54 transitions, 242 flow [2022-12-13 08:39:31,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-13 08:39:31,093 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:31,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 08:39:31,096 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 54 transitions, 242 flow [2022-12-13 08:39:31,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:31,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:31,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:31,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:39:31,100 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-13 08:39:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -738367988, now seen corresponding path program 1 times [2022-12-13 08:39:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868155374] [2022-12-13 08:39:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:31,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868155374] [2022-12-13 08:39:31,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868155374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:31,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:31,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:39:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762798278] [2022-12-13 08:39:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:31,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:39:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:39:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:39:31,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-13 08:39:31,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 54 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:31,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:31,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-13 08:39:31,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:31,990 INFO L130 PetriNetUnfolder]: 3470/4850 cut-off events. [2022-12-13 08:39:31,990 INFO L131 PetriNetUnfolder]: For 1086/1113 co-relation queries the response was YES. [2022-12-13 08:39:31,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13697 conditions, 4850 events. 3470/4850 cut-off events. For 1086/1113 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 23528 event pairs, 309 based on Foata normal form. 2/3296 useless extension candidates. Maximal degree in co-relation 10522. Up to 3484 conditions per place. [2022-12-13 08:39:32,065 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 138 selfloop transitions, 10 changer transitions 0/152 dead transitions. [2022-12-13 08:39:32,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:39:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:39:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 08:39:32,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 08:39:32,071 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-12-13 08:39:32,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:32,136 INFO L89 Accepts]: Start accepts. Operand has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:32,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:32,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 08:39:32,300 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:39:32,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 08:39:32,302 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 152 transitions, 1000 flow [2022-12-13 08:39:32,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:32,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:32,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:32,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:39:32,303 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-13 08:39:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -77170268, now seen corresponding path program 2 times [2022-12-13 08:39:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:32,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377111623] [2022-12-13 08:39:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:32,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377111623] [2022-12-13 08:39:32,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377111623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:32,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:32,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 08:39:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525748660] [2022-12-13 08:39:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:32,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:39:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:39:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:39:32,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 08:39:32,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 152 transitions, 1000 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:32,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:32,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 08:39:32,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:33,781 INFO L130 PetriNetUnfolder]: 7175/9834 cut-off events. [2022-12-13 08:39:33,781 INFO L131 PetriNetUnfolder]: For 3707/3707 co-relation queries the response was YES. [2022-12-13 08:39:33,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35051 conditions, 9834 events. 7175/9834 cut-off events. For 3707/3707 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 47532 event pairs, 400 based on Foata normal form. 4/7688 useless extension candidates. Maximal degree in co-relation 33443. Up to 5740 conditions per place. [2022-12-13 08:39:33,833 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 167 selfloop transitions, 36 changer transitions 226/429 dead transitions. [2022-12-13 08:39:33,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 429 transitions, 3645 flow [2022-12-13 08:39:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:39:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:39:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-13 08:39:33,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5546218487394958 [2022-12-13 08:39:33,837 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-13 08:39:33,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 429 transitions, 3645 flow [2022-12-13 08:39:33,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 203 transitions, 1689 flow [2022-12-13 08:39:33,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:33,913 INFO L89 Accepts]: Start accepts. Operand has 52 places, 203 transitions, 1689 flow [2022-12-13 08:39:33,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:33,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:33,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 203 transitions, 1689 flow [2022-12-13 08:39:33,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 203 transitions, 1689 flow [2022-12-13 08:39:33,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:34,958 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 08:39:34,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1047 [2022-12-13 08:39:34,959 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 203 transitions, 1689 flow [2022-12-13 08:39:34,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:34,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:34,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:34,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:39:34,960 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-13 08:39:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1859619516, now seen corresponding path program 3 times [2022-12-13 08:39:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894045340] [2022-12-13 08:39:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:35,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894045340] [2022-12-13 08:39:35,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894045340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:35,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:35,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:39:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212796031] [2022-12-13 08:39:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:35,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:39:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:39:35,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:39:35,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 08:39:35,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 203 transitions, 1689 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:35,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:35,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 08:39:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:36,427 INFO L130 PetriNetUnfolder]: 7727/10572 cut-off events. [2022-12-13 08:39:36,427 INFO L131 PetriNetUnfolder]: For 4051/4051 co-relation queries the response was YES. [2022-12-13 08:39:36,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48680 conditions, 10572 events. 7727/10572 cut-off events. For 4051/4051 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 49811 event pairs, 398 based on Foata normal form. 24/8112 useless extension candidates. Maximal degree in co-relation 46584. Up to 9964 conditions per place. [2022-12-13 08:39:36,498 INFO L137 encePairwiseOnDemand]: 27/46 looper letters, 578 selfloop transitions, 90 changer transitions 4/672 dead transitions. [2022-12-13 08:39:36,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 672 transitions, 6943 flow [2022-12-13 08:39:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:39:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:39:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2022-12-13 08:39:36,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47282608695652173 [2022-12-13 08:39:36,501 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-12-13 08:39:36,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 672 transitions, 6943 flow [2022-12-13 08:39:36,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 668 transitions, 6903 flow [2022-12-13 08:39:36,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:36,606 INFO L89 Accepts]: Start accepts. Operand has 59 places, 668 transitions, 6903 flow [2022-12-13 08:39:36,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:36,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:36,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 668 transitions, 6903 flow [2022-12-13 08:39:36,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 668 transitions, 6903 flow [2022-12-13 08:39:36,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:36,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:39:36,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-13 08:39:36,809 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 668 transitions, 6903 flow [2022-12-13 08:39:36,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:36,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:36,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:36,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 08:39:36,810 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-13 08:39:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1902348553, now seen corresponding path program 1 times [2022-12-13 08:39:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:36,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101920816] [2022-12-13 08:39:36,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:36,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101920816] [2022-12-13 08:39:36,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101920816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:36,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:36,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:39:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685953302] [2022-12-13 08:39:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:36,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:39:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:39:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:39:36,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 48 [2022-12-13 08:39:36,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 668 transitions, 6903 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:36,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:36,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 48 [2022-12-13 08:39:36,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:38,546 INFO L130 PetriNetUnfolder]: 9549/13216 cut-off events. [2022-12-13 08:39:38,546 INFO L131 PetriNetUnfolder]: For 8389/8389 co-relation queries the response was YES. [2022-12-13 08:39:38,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72616 conditions, 13216 events. 9549/13216 cut-off events. For 8389/8389 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 66331 event pairs, 500 based on Foata normal form. 8/10078 useless extension candidates. Maximal degree in co-relation 69728. Up to 12544 conditions per place. [2022-12-13 08:39:38,638 INFO L137 encePairwiseOnDemand]: 32/48 looper letters, 1293 selfloop transitions, 156 changer transitions 25/1535 dead transitions. [2022-12-13 08:39:38,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 1535 transitions, 19012 flow [2022-12-13 08:39:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:39:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:39:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 08:39:38,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-13 08:39:38,642 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2022-12-13 08:39:38,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 1535 transitions, 19012 flow [2022-12-13 08:39:38,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 1510 transitions, 18712 flow [2022-12-13 08:39:38,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:38,799 INFO L89 Accepts]: Start accepts. Operand has 63 places, 1510 transitions, 18712 flow [2022-12-13 08:39:38,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:38,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:38,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 1510 transitions, 18712 flow [2022-12-13 08:39:38,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 1510 transitions, 18712 flow [2022-12-13 08:39:38,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:38,858 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:38,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 08:39:38,860 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 1510 transitions, 18712 flow [2022-12-13 08:39:38,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:38,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:38,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:38,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:39:38,860 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-13 08:39:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash -729701929, now seen corresponding path program 2 times [2022-12-13 08:39:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265981700] [2022-12-13 08:39:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:39,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265981700] [2022-12-13 08:39:39,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265981700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:39,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:39,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 08:39:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625786590] [2022-12-13 08:39:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:39,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:39:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:39:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:39:39,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 08:39:39,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 1510 transitions, 18712 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:39,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:39,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 08:39:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:43,458 INFO L130 PetriNetUnfolder]: 17670/25009 cut-off events. [2022-12-13 08:39:43,458 INFO L131 PetriNetUnfolder]: For 15938/15938 co-relation queries the response was YES. [2022-12-13 08:39:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163230 conditions, 25009 events. 17670/25009 cut-off events. For 15938/15938 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 145838 event pairs, 560 based on Foata normal form. 20/19227 useless extension candidates. Maximal degree in co-relation 156021. Up to 24314 conditions per place. [2022-12-13 08:39:43,633 INFO L137 encePairwiseOnDemand]: 32/48 looper letters, 3022 selfloop transitions, 228 changer transitions 6/3256 dead transitions. [2022-12-13 08:39:43,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 3256 transitions, 46811 flow [2022-12-13 08:39:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:39:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:39:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2022-12-13 08:39:43,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2022-12-13 08:39:43,636 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2022-12-13 08:39:43,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 3256 transitions, 46811 flow [2022-12-13 08:39:43,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 3250 transitions, 46727 flow [2022-12-13 08:39:43,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:43,873 INFO L89 Accepts]: Start accepts. Operand has 71 places, 3250 transitions, 46727 flow [2022-12-13 08:39:43,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:43,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:43,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 3250 transitions, 46727 flow [2022-12-13 08:39:43,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 3250 transitions, 46727 flow [2022-12-13 08:39:43,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:44,011 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:44,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 08:39:44,012 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 3250 transitions, 46727 flow [2022-12-13 08:39:44,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:44,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:44,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:44,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:39:44,013 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-13 08:39:44,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1884442362, now seen corresponding path program 1 times [2022-12-13 08:39:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:44,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444831661] [2022-12-13 08:39:44,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444831661] [2022-12-13 08:39:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444831661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:44,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:39:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451224325] [2022-12-13 08:39:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:44,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:39:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:39:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:39:44,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 47 [2022-12-13 08:39:44,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 3250 transitions, 46727 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:44,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:44,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 47 [2022-12-13 08:39:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:39:55,676 INFO L130 PetriNetUnfolder]: 30232/42749 cut-off events. [2022-12-13 08:39:55,676 INFO L131 PetriNetUnfolder]: For 31860/31860 co-relation queries the response was YES. [2022-12-13 08:39:55,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317759 conditions, 42749 events. 30232/42749 cut-off events. For 31860/31860 co-relation queries the response was YES. Maximal size of possible extension queue 1752. Compared 269680 event pairs, 706 based on Foata normal form. 90/32413 useless extension candidates. Maximal degree in co-relation 303870. Up to 41885 conditions per place. [2022-12-13 08:39:56,017 INFO L137 encePairwiseOnDemand]: 28/47 looper letters, 5312 selfloop transitions, 419 changer transitions 11/5851 dead transitions. [2022-12-13 08:39:56,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 5851 transitions, 96222 flow [2022-12-13 08:39:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:39:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:39:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-13 08:39:56,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2022-12-13 08:39:56,019 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2022-12-13 08:39:56,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 5851 transitions, 96222 flow [2022-12-13 08:39:56,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 5840 transitions, 96043 flow [2022-12-13 08:39:56,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:39:56,511 INFO L89 Accepts]: Start accepts. Operand has 75 places, 5840 transitions, 96043 flow [2022-12-13 08:39:56,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:39:56,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:39:56,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 5840 transitions, 96043 flow [2022-12-13 08:39:56,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 5840 transitions, 96043 flow [2022-12-13 08:39:56,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:39:56,674 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:39:56,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 08:39:56,675 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 5840 transitions, 96043 flow [2022-12-13 08:39:56,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:56,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:39:56,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:39:56,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 08:39:56,675 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-13 08:39:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:39:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1219626256, now seen corresponding path program 2 times [2022-12-13 08:39:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:39:56,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362730766] [2022-12-13 08:39:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:39:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:39:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:39:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:39:57,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:39:57,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362730766] [2022-12-13 08:39:57,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362730766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:39:57,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:39:57,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:39:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959028377] [2022-12-13 08:39:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:39:57,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:39:57,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:39:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:39:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:39:57,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 47 [2022-12-13 08:39:57,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 5840 transitions, 96043 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:39:57,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:39:57,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 47 [2022-12-13 08:39:57,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:40:22,869 INFO L130 PetriNetUnfolder]: 38130/53855 cut-off events. [2022-12-13 08:40:22,870 INFO L131 PetriNetUnfolder]: For 50259/50259 co-relation queries the response was YES. [2022-12-13 08:40:22,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444313 conditions, 53855 events. 38130/53855 cut-off events. For 50259/50259 co-relation queries the response was YES. Maximal size of possible extension queue 2095. Compared 348160 event pairs, 790 based on Foata normal form. 90/41375 useless extension candidates. Maximal degree in co-relation 427279. Up to 52995 conditions per place. [2022-12-13 08:40:23,272 INFO L137 encePairwiseOnDemand]: 28/47 looper letters, 6204 selfloop transitions, 658 changer transitions 8/6979 dead transitions. [2022-12-13 08:40:23,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 6979 transitions, 128473 flow [2022-12-13 08:40:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:40:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:40:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2022-12-13 08:40:23,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2022-12-13 08:40:23,274 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-13 08:40:23,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 6979 transitions, 128473 flow [2022-12-13 08:40:23,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 6971 transitions, 128329 flow [2022-12-13 08:40:24,003 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:40:24,003 INFO L89 Accepts]: Start accepts. Operand has 80 places, 6971 transitions, 128329 flow [2022-12-13 08:40:24,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:40:24,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:40:24,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 6971 transitions, 128329 flow [2022-12-13 08:40:24,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 6971 transitions, 128329 flow [2022-12-13 08:40:24,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:40:24,205 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:40:24,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-13 08:40:24,206 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 6971 transitions, 128329 flow [2022-12-13 08:40:24,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:24,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:40:24,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:40:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 08:40:24,206 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-13 08:40:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:40:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2086869564, now seen corresponding path program 1 times [2022-12-13 08:40:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:40:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313876531] [2022-12-13 08:40:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:40:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:24,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:40:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313876531] [2022-12-13 08:40:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313876531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:40:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886556708] [2022-12-13 08:40:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:40:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:40:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:40:24,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:40:24,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-13 08:40:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:40:24,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 08:40:24,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:40:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:24,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:40:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:40:25,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886556708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:40:25,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:40:25,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 16 [2022-12-13 08:40:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704678356] [2022-12-13 08:40:25,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:40:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:40:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:40:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:40:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:40:25,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 08:40:25,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 6971 transitions, 128329 flow. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:40:25,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:40:25,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 08:40:25,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:43:33,879 INFO L130 PetriNetUnfolder]: 177217/252360 cut-off events. [2022-12-13 08:43:33,879 INFO L131 PetriNetUnfolder]: For 258103/258103 co-relation queries the response was YES. [2022-12-13 08:43:34,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325168 conditions, 252360 events. 177217/252360 cut-off events. For 258103/258103 co-relation queries the response was YES. Maximal size of possible extension queue 10163. Compared 1993553 event pairs, 602 based on Foata normal form. 812/199274 useless extension candidates. Maximal degree in co-relation 2245880. Up to 251058 conditions per place. [2022-12-13 08:43:36,064 INFO L137 encePairwiseOnDemand]: 16/46 looper letters, 32304 selfloop transitions, 11936 changer transitions 735/44975 dead transitions. [2022-12-13 08:43:36,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 44975 transitions, 905096 flow [2022-12-13 08:43:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-12-13 08:43:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2022-12-13 08:43:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 3661 transitions. [2022-12-13 08:43:36,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3248447204968944 [2022-12-13 08:43:36,078 INFO L295 CegarLoopForPetriNet]: 42 programPoint places, 282 predicate places. [2022-12-13 08:43:36,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 44975 transitions, 905096 flow [2022-12-13 08:43:38,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 44240 transitions, 890464 flow [2022-12-13 08:43:40,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:43:40,595 INFO L89 Accepts]: Start accepts. Operand has 324 places, 44240 transitions, 890464 flow [2022-12-13 08:43:40,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:43:40,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:43:40,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 44240 transitions, 890464 flow [2022-12-13 08:43:45,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 44240 transitions, 890464 flow [2022-12-13 08:43:45,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:43:45,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:43:45,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5263 [2022-12-13 08:43:45,858 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 44240 transitions, 890464 flow [2022-12-13 08:43:45,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:45,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:43:45,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:43:45,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 08:43:46,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:46,064 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-13 08:43:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:43:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1172446495, now seen corresponding path program 1 times [2022-12-13 08:43:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:43:46,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363596453] [2022-12-13 08:43:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:43:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:43:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:43:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:43:46,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363596453] [2022-12-13 08:43:46,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363596453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:43:46,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:43:46,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:43:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677247005] [2022-12-13 08:43:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:43:46,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 08:43:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:43:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 08:43:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:43:46,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 08:43:46,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 44240 transitions, 890464 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:46,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:43:46,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 08:43:46,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:53:10,665 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:53:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:53:10,839 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 08:53:10,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 08:53:10,839 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/46 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 743207 conditions, 73350 events (54218/73349 cut-off events. For 109354/109354 co-relation queries the response was YES. Maximal size of possible extension queue 10707. Compared 522588 event pairs, 206 based on Foata normal form. 235/66125 useless extension candidates. Maximal degree in co-relation 742916. Up to 72080 conditions per place.). [2022-12-13 08:53:10,840 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 08:53:10,840 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 08:53:10,840 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 08:53:10,840 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 08:53:10,841 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2022-12-13 08:53:10,843 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:53:10,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:53:10,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:53:10 BasicIcfg [2022-12-13 08:53:10,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:53:10,846 INFO L158 Benchmark]: Toolchain (without parser) took 826405.10ms. Allocated memory was 198.2MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 174.2MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 6.9GB. Max. memory is 8.0GB. [2022-12-13 08:53:10,846 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 198.2MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:53:10,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.77ms. Allocated memory is still 198.2MB. Free memory was 174.2MB in the beginning and 160.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 08:53:10,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.53ms. Allocated memory is still 198.2MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:53:10,847 INFO L158 Benchmark]: Boogie Preprocessor took 23.51ms. Allocated memory is still 198.2MB. Free memory was 158.0MB in the beginning and 156.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:53:10,847 INFO L158 Benchmark]: RCFGBuilder took 542.00ms. Allocated memory is still 198.2MB. Free memory was 156.4MB in the beginning and 137.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 08:53:10,847 INFO L158 Benchmark]: TraceAbstraction took 825538.85ms. Allocated memory was 198.2MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 136.5MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 6.9GB. Max. memory is 8.0GB. [2022-12-13 08:53:10,848 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 198.2MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.77ms. Allocated memory is still 198.2MB. Free memory was 174.2MB in the beginning and 160.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.53ms. Allocated memory is still 198.2MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.51ms. Allocated memory is still 198.2MB. Free memory was 158.0MB in the beginning and 156.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 542.00ms. Allocated memory is still 198.2MB. Free memory was 156.4MB in the beginning and 137.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 825538.85ms. Allocated memory was 198.2MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 136.5MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 6.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 115 PlacesBefore, 42 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 29 ConcurrentYvCompositions, 6 ChoiceCompositions, 79 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 911, independent: 895, independent conditional: 895, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 911, independent: 895, independent conditional: 0, independent unconditional: 895, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 911, independent: 895, independent conditional: 0, independent unconditional: 895, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 911, independent: 895, independent conditional: 0, independent unconditional: 895, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 881, independent: 866, independent conditional: 0, independent unconditional: 866, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 881, independent: 866, independent conditional: 0, independent unconditional: 866, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 562, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 562, dependent conditional: 0, dependent unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 911, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 881, unknown conditional: 0, unknown unconditional: 881] , Statistics on independence cache: Total cache size (in pairs): 1288, Positive cache size: 1273, Positive conditional cache size: 0, Positive unconditional cache size: 1273, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 44 PlacesBefore, 44 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 48 PlacesBefore, 48 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 196, independent conditional: 108, independent unconditional: 88, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 196, independent conditional: 54, independent unconditional: 142, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 196, independent conditional: 54, independent unconditional: 142, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 1, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 177, independent conditional: 53, independent unconditional: 124, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 20, unknown conditional: 1, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 28, Positive conditional cache size: 1, Positive unconditional cache size: 27, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 52 PlacesBefore, 52 PlacesAfterwards, 203 TransitionsBefore, 203 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 59 PlacesBefore, 59 PlacesAfterwards, 668 TransitionsBefore, 668 TransitionsAfterwards, 0 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 63 PlacesBefore, 63 PlacesAfterwards, 1510 TransitionsBefore, 1510 TransitionsAfterwards, 0 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 71 PlacesBefore, 71 PlacesAfterwards, 3250 TransitionsBefore, 3250 TransitionsAfterwards, 0 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 75 PlacesBefore, 75 PlacesAfterwards, 5840 TransitionsBefore, 5840 TransitionsAfterwards, 0 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 80 PlacesBefore, 80 PlacesAfterwards, 6971 TransitionsBefore, 6971 TransitionsAfterwards, 0 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 324 PlacesBefore, 324 PlacesAfterwards, 44240 TransitionsBefore, 44240 TransitionsAfterwards, 0 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): 35, Positive cache size: 33, Positive conditional cache size: 1, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (6states, 0/46 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 743207 conditions, 73350 events (54218/73349 cut-off events. For 109354/109354 co-relation queries the response was YES. Maximal size of possible extension queue 10707. Compared 522588 event pairs, 206 based on Foata normal form. 235/66125 useless extension candidates. Maximal degree in co-relation 742916. Up to 72080 conditions per place.). - TimeoutResultAtElement [Line: 129]: 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 (6states, 0/46 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 743207 conditions, 73350 events (54218/73349 cut-off events. For 109354/109354 co-relation queries the response was YES. Maximal size of possible extension queue 10707. Compared 522588 event pairs, 206 based on Foata normal form. 235/66125 useless extension candidates. Maximal degree in co-relation 742916. Up to 72080 conditions per place.). - TimeoutResultAtElement [Line: 131]: 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 (6states, 0/46 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 743207 conditions, 73350 events (54218/73349 cut-off events. For 109354/109354 co-relation queries the response was YES. Maximal size of possible extension queue 10707. Compared 522588 event pairs, 206 based on Foata normal form. 235/66125 useless extension candidates. Maximal degree in co-relation 742916. Up to 72080 conditions per place.). - TimeoutResultAtElement [Line: 132]: 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 (6states, 0/46 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 743207 conditions, 73350 events (54218/73349 cut-off events. For 109354/109354 co-relation queries the response was YES. Maximal size of possible extension queue 10707. Compared 522588 event pairs, 206 based on Foata normal form. 235/66125 useless extension candidates. Maximal degree in co-relation 742916. Up to 72080 conditions per place.). - TimeoutResultAtElement [Line: 130]: 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 (6states, 0/46 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 743207 conditions, 73350 events (54218/73349 cut-off events. For 109354/109354 co-relation queries the response was YES. Maximal size of possible extension queue 10707. Compared 522588 event pairs, 206 based on Foata normal form. 235/66125 useless extension candidates. Maximal degree in co-relation 742916. Up to 72080 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 151 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: 825.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 803.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2471 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2471 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 635 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8692 IncrementalHoareTripleChecker+Invalid, 9327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 635 mSolverCounterUnsat, 48 mSDtfsCounter, 8692 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27498 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890464occurred in iteration=9, InterpolantAutomatonStates: 293, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1775 SizeOfPredicates, 12 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 8/11 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