/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:39:15,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:39:15,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:39:16,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:39:16,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:39:16,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:39:16,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:39:16,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:39:16,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:39:16,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:39:16,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:39:16,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:39:16,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:39:16,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:39:16,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:39:16,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:39:16,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:39:16,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:39:16,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:39:16,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:39:16,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:39:16,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:39:16,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:39:16,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:39:16,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:39:16,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:39:16,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:39:16,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:39:16,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:39:16,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:39:16,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:39:16,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:39:16,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:39:16,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:39:16,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:39:16,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:39:16,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:39:16,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:39:16,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:39:16,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:39:16,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:39:16,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:39:16,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:39:16,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:39:16,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:39:16,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:39:16,127 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:39:16,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:39:16,128 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:39:16,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:39:16,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:39:16,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:39:16,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:39:16,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:39:16,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:39:16,129 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:39:16,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:39:16,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:39:16,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:39:16,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:39:16,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:39:16,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:39:16,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:39:16,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:39:16,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:39:16,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:39:16,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:39:16,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:39:16,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:39:16,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:39:16,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:39:16,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:39:16,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:39:16,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:39:16,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:39:16,459 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:39:16,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2022-12-06 01:39:17,648 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:39:17,975 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:39:17,975 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2022-12-06 01:39:17,997 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03f8fdc2/b95784dc375e486ab2466b4cd493fa2a/FLAG84228a86d [2022-12-06 01:39:18,016 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03f8fdc2/b95784dc375e486ab2466b4cd493fa2a [2022-12-06 01:39:18,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:39:18,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:39:18,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:39:18,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:39:18,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:39:18,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af95f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18, skipping insertion in model container [2022-12-06 01:39:18,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:39:18,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:39:18,244 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2022-12-06 01:39:18,458 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,464 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,468 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,474 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:39:18,485 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:39:18,494 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2022-12-06 01:39:18,526 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,528 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,529 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,539 WARN L623 FunctionHandler]: Unknown extern function sleep [2022-12-06 01:39:18,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:39:18,592 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:39:18,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18 WrapperNode [2022-12-06 01:39:18,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:39:18,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:39:18,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:39:18,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:39:18,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,641 INFO L138 Inliner]: procedures = 271, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2022-12-06 01:39:18,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:39:18,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:39:18,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:39:18,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:39:18,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,694 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:39:18,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:39:18,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:39:18,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:39:18,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (1/1) ... [2022-12-06 01:39:18,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:39:18,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:39:18,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:39:18,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:39:18,767 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2022-12-06 01:39:18,768 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:39:18,768 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2022-12-06 01:39:18,769 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2022-12-06 01:39:18,769 INFO L130 BoogieDeclarations]: Found specification of procedure process [2022-12-06 01:39:18,769 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2022-12-06 01:39:18,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:39:18,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:39:18,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:39:18,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:39:19,060 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:39:19,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:39:19,254 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:39:19,264 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:39:19,265 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 01:39:19,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:39:19 BoogieIcfgContainer [2022-12-06 01:39:19,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:39:19,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:39:19,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:39:19,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:39:19,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:39:18" (1/3) ... [2022-12-06 01:39:19,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d468e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:39:19, skipping insertion in model container [2022-12-06 01:39:19,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:39:18" (2/3) ... [2022-12-06 01:39:19,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d468e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:39:19, skipping insertion in model container [2022-12-06 01:39:19,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:39:19" (3/3) ... [2022-12-06 01:39:19,273 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2022-12-06 01:39:19,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:39:19,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:39:19,291 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:39:19,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:39:19,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 152 transitions, 319 flow [2022-12-06 01:39:19,521 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-06 01:39:19,521 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:39:19,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 12/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 313 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-06 01:39:19,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 152 transitions, 319 flow [2022-12-06 01:39:19,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 307 flow [2022-12-06 01:39:19,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:19,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 307 flow [2022-12-06 01:39:19,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 307 flow [2022-12-06 01:39:19,602 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-06 01:39:19,602 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:39:19,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 12/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 314 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-06 01:39:19,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 307 flow [2022-12-06 01:39:19,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 8738 [2022-12-06 01:39:24,738 INFO L203 LiptonReduction]: Total number of compositions: 111 [2022-12-06 01:39:24,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:39:24,765 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;@7813f963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:39:24,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 01:39:24,772 INFO L130 PetriNetUnfolder]: 4/38 cut-off events. [2022-12-06 01:39:24,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:39:24,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:24,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:24,774 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 3 more)] === [2022-12-06 01:39:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 972956223, now seen corresponding path program 1 times [2022-12-06 01:39:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:24,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026095770] [2022-12-06 01:39:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:25,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026095770] [2022-12-06 01:39:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026095770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:25,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:25,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:39:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339094485] [2022-12-06 01:39:25,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:25,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:39:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:39:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:39:25,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2022-12-06 01:39:25,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:25,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:25,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2022-12-06 01:39:25,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:27,027 INFO L130 PetriNetUnfolder]: 15726/21468 cut-off events. [2022-12-06 01:39:27,027 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 01:39:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42368 conditions, 21468 events. 15726/21468 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 115312 event pairs, 3672 based on Foata normal form. 0/17457 useless extension candidates. Maximal degree in co-relation 42357. Up to 15501 conditions per place. [2022-12-06 01:39:27,213 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 64 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2022-12-06 01:39:27,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 309 flow [2022-12-06 01:39:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:39:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:39:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-12-06 01:39:27,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 01:39:27,226 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-06 01:39:27,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:27,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 77 transitions, 309 flow [2022-12-06 01:39:27,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 77 transitions, 309 flow [2022-12-06 01:39:27,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 01:39:27,645 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:39:27,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-06 01:39:27,647 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 75 transitions, 305 flow [2022-12-06 01:39:27,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:27,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:27,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:27,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:39:27,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:39:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 148386387, now seen corresponding path program 1 times [2022-12-06 01:39:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343245251] [2022-12-06 01:39:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343245251] [2022-12-06 01:39:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343245251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:27,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:27,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:39:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116029329] [2022-12-06 01:39:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:27,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:39:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:39:27,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:39:27,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2022-12-06 01:39:27,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 75 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:27,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:27,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2022-12-06 01:39:27,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:30,785 INFO L130 PetriNetUnfolder]: 30891/42221 cut-off events. [2022-12-06 01:39:30,785 INFO L131 PetriNetUnfolder]: For 1626/1628 co-relation queries the response was YES. [2022-12-06 01:39:30,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121313 conditions, 42221 events. 30891/42221 cut-off events. For 1626/1628 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 230272 event pairs, 2864 based on Foata normal form. 0/35429 useless extension candidates. Maximal degree in co-relation 121299. Up to 33952 conditions per place. [2022-12-06 01:39:31,038 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 187 selfloop transitions, 9 changer transitions 0/205 dead transitions. [2022-12-06 01:39:31,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 205 transitions, 1223 flow [2022-12-06 01:39:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:39:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:39:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-12-06 01:39:31,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6977777777777778 [2022-12-06 01:39:31,044 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2022-12-06 01:39:31,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:31,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 205 transitions, 1223 flow [2022-12-06 01:39:31,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 205 transitions, 1223 flow [2022-12-06 01:39:31,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 1218 [2022-12-06 01:39:31,222 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:31,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 01:39:31,224 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 205 transitions, 1223 flow [2022-12-06 01:39:31,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:31,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:31,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:31,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:39:31,225 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 3 more)] === [2022-12-06 01:39:31,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash -426647106, now seen corresponding path program 1 times [2022-12-06 01:39:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:31,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846220711] [2022-12-06 01:39:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846220711] [2022-12-06 01:39:31,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846220711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:31,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:31,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:39:31,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621372522] [2022-12-06 01:39:31,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:31,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:39:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:39:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:39:31,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2022-12-06 01:39:31,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 205 transitions, 1223 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-06 01:39:31,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:31,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2022-12-06 01:39:31,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:35,771 INFO L130 PetriNetUnfolder]: 51824/71537 cut-off events. [2022-12-06 01:39:35,771 INFO L131 PetriNetUnfolder]: For 16831/16835 co-relation queries the response was YES. [2022-12-06 01:39:35,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260097 conditions, 71537 events. 51824/71537 cut-off events. For 16831/16835 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 431838 event pairs, 6111 based on Foata normal form. 1005/62703 useless extension candidates. Maximal degree in co-relation 260080. Up to 58578 conditions per place. [2022-12-06 01:39:36,231 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 254 selfloop transitions, 66 changer transitions 0/353 dead transitions. [2022-12-06 01:39:36,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 353 transitions, 2769 flow [2022-12-06 01:39:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:39:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:39:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-12-06 01:39:36,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2022-12-06 01:39:36,235 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2022-12-06 01:39:36,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:36,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 353 transitions, 2769 flow [2022-12-06 01:39:36,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 353 transitions, 2769 flow [2022-12-06 01:39:36,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 2094 [2022-12-06 01:39:36,548 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:36,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 01:39:36,549 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 353 transitions, 2769 flow [2022-12-06 01:39:36,549 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-06 01:39:36,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:36,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:36,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:39:36,549 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 3 more)] === [2022-12-06 01:39:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash -68338615, now seen corresponding path program 1 times [2022-12-06 01:39:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:36,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766328073] [2022-12-06 01:39:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:36,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766328073] [2022-12-06 01:39:36,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766328073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:36,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:36,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:39:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814433745] [2022-12-06 01:39:36,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:36,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:39:36,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:36,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:39:36,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:39:36,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-06 01:39:36,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 353 transitions, 2769 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:36,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:36,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-06 01:39:36,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:41,831 INFO L130 PetriNetUnfolder]: 53216/73686 cut-off events. [2022-12-06 01:39:41,831 INFO L131 PetriNetUnfolder]: For 23419/23422 co-relation queries the response was YES. [2022-12-06 01:39:41,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339358 conditions, 73686 events. 53216/73686 cut-off events. For 23419/23422 co-relation queries the response was YES. Maximal size of possible extension queue 1744. Compared 451961 event pairs, 4536 based on Foata normal form. 0/64576 useless extension candidates. Maximal degree in co-relation 339338. Up to 61893 conditions per place. [2022-12-06 01:39:42,327 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 519 selfloop transitions, 51 changer transitions 0/575 dead transitions. [2022-12-06 01:39:42,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 575 transitions, 5643 flow [2022-12-06 01:39:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:39:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:39:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2022-12-06 01:39:42,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6711111111111111 [2022-12-06 01:39:42,329 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2022-12-06 01:39:42,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:42,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 575 transitions, 5643 flow [2022-12-06 01:39:42,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 575 transitions, 5643 flow [2022-12-06 01:39:42,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 2974 [2022-12-06 01:39:42,626 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:42,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 01:39:42,627 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 575 transitions, 5643 flow [2022-12-06 01:39:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:42,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:42,627 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:42,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:39:42,628 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 3 more)] === [2022-12-06 01:39:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash 723170071, now seen corresponding path program 1 times [2022-12-06 01:39:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686702231] [2022-12-06 01:39:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:42,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686702231] [2022-12-06 01:39:42,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686702231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:42,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:42,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:39:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568574595] [2022-12-06 01:39:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:42,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:39:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:39:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:39:42,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2022-12-06 01:39:42,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 575 transitions, 5643 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:42,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:42,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2022-12-06 01:39:42,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:44,036 INFO L130 PetriNetUnfolder]: 8727/12822 cut-off events. [2022-12-06 01:39:44,036 INFO L131 PetriNetUnfolder]: For 11758/11776 co-relation queries the response was YES. [2022-12-06 01:39:44,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69221 conditions, 12822 events. 8727/12822 cut-off events. For 11758/11776 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 68202 event pairs, 535 based on Foata normal form. 345/12096 useless extension candidates. Maximal degree in co-relation 69198. Up to 9916 conditions per place. [2022-12-06 01:39:44,134 INFO L137 encePairwiseOnDemand]: 37/45 looper letters, 263 selfloop transitions, 38 changer transitions 0/339 dead transitions. [2022-12-06 01:39:44,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 339 transitions, 3921 flow [2022-12-06 01:39:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:39:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:39:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 01:39:44,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-12-06 01:39:44,136 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2022-12-06 01:39:44,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:44,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 339 transitions, 3921 flow [2022-12-06 01:39:44,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 339 transitions, 3921 flow [2022-12-06 01:39:44,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 2074 [2022-12-06 01:39:44,206 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:44,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 01:39:44,207 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 339 transitions, 3921 flow [2022-12-06 01:39:44,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:44,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:44,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:44,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:39:44,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:39:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash -380972666, now seen corresponding path program 1 times [2022-12-06 01:39:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:44,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285955995] [2022-12-06 01:39:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:44,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285955995] [2022-12-06 01:39:44,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285955995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:44,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:44,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:39:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365370634] [2022-12-06 01:39:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:44,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:39:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:39:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:39:44,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2022-12-06 01:39:44,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 339 transitions, 3921 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-06 01:39:44,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:44,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2022-12-06 01:39:44,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:45,210 INFO L130 PetriNetUnfolder]: 6498/9763 cut-off events. [2022-12-06 01:39:45,210 INFO L131 PetriNetUnfolder]: For 19508/19526 co-relation queries the response was YES. [2022-12-06 01:39:45,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60372 conditions, 9763 events. 6498/9763 cut-off events. For 19508/19526 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 51539 event pairs, 477 based on Foata normal form. 454/9404 useless extension candidates. Maximal degree in co-relation 60346. Up to 7705 conditions per place. [2022-12-06 01:39:45,266 INFO L137 encePairwiseOnDemand]: 34/45 looper letters, 362 selfloop transitions, 77 changer transitions 0/471 dead transitions. [2022-12-06 01:39:45,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 471 transitions, 6413 flow [2022-12-06 01:39:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:39:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:39:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-06 01:39:45,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 01:39:45,267 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2022-12-06 01:39:45,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:45,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 471 transitions, 6413 flow [2022-12-06 01:39:45,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 471 transitions, 6413 flow [2022-12-06 01:39:45,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 2780 [2022-12-06 01:39:45,322 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:45,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 01:39:45,323 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 471 transitions, 6413 flow [2022-12-06 01:39:45,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-06 01:39:45,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:45,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:39:45,324 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 3 more)] === [2022-12-06 01:39:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1474723234, now seen corresponding path program 1 times [2022-12-06 01:39:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:45,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774814105] [2022-12-06 01:39:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:45,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:45,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774814105] [2022-12-06 01:39:45,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774814105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:45,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:45,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:39:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102580749] [2022-12-06 01:39:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:45,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:39:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:39:45,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:39:45,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-06 01:39:45,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 471 transitions, 6413 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-06 01:39:45,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:45,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-06 01:39:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:47,027 INFO L130 PetriNetUnfolder]: 8258/12315 cut-off events. [2022-12-06 01:39:47,027 INFO L131 PetriNetUnfolder]: For 22775/22799 co-relation queries the response was YES. [2022-12-06 01:39:47,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88116 conditions, 12315 events. 8258/12315 cut-off events. For 22775/22799 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 65448 event pairs, 570 based on Foata normal form. 0/11124 useless extension candidates. Maximal degree in co-relation 88087. Up to 10191 conditions per place. [2022-12-06 01:39:47,093 INFO L137 encePairwiseOnDemand]: 37/45 looper letters, 612 selfloop transitions, 45 changer transitions 0/662 dead transitions. [2022-12-06 01:39:47,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 662 transitions, 10333 flow [2022-12-06 01:39:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:39:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:39:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-06 01:39:47,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 01:39:47,095 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2022-12-06 01:39:47,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:47,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 662 transitions, 10333 flow [2022-12-06 01:39:47,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 662 transitions, 10333 flow [2022-12-06 01:39:47,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 3690 [2022-12-06 01:39:47,163 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:47,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 01:39:47,163 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 662 transitions, 10333 flow [2022-12-06 01:39:47,164 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-06 01:39:47,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:47,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:47,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:39:47,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:39:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash -228374438, now seen corresponding path program 1 times [2022-12-06 01:39:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:47,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631640369] [2022-12-06 01:39:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:39:47,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:47,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631640369] [2022-12-06 01:39:47,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631640369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:39:47,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:39:47,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:39:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670995120] [2022-12-06 01:39:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:39:47,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:39:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:39:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:39:47,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-06 01:39:47,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 662 transitions, 10333 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:47,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:47,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-06 01:39:47,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:50,022 INFO L130 PetriNetUnfolder]: 11596/17560 cut-off events. [2022-12-06 01:39:50,022 INFO L131 PetriNetUnfolder]: For 32611/32619 co-relation queries the response was YES. [2022-12-06 01:39:50,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143025 conditions, 17560 events. 11596/17560 cut-off events. For 32611/32619 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 94339 event pairs, 249 based on Foata normal form. 0/16278 useless extension candidates. Maximal degree in co-relation 142993. Up to 15095 conditions per place. [2022-12-06 01:39:50,129 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 1254 selfloop transitions, 119 changer transitions 0/1378 dead transitions. [2022-12-06 01:39:50,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 1378 transitions, 24139 flow [2022-12-06 01:39:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 01:39:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 01:39:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 420 transitions. [2022-12-06 01:39:50,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-06 01:39:50,132 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2022-12-06 01:39:50,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:50,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 1378 transitions, 24139 flow [2022-12-06 01:39:50,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 1378 transitions, 24139 flow [2022-12-06 01:39:50,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 6716 [2022-12-06 01:39:50,284 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:50,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 01:39:50,285 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 1378 transitions, 24139 flow [2022-12-06 01:39:50,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:50,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:39:50,286 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:50,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:39:50,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:39:50,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:39:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash 499002122, now seen corresponding path program 1 times [2022-12-06 01:39:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:39:50,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830026253] [2022-12-06 01:39:50,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:39:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:39:50,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:39:50,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830026253] [2022-12-06 01:39:50,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830026253] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:39:50,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711788452] [2022-12-06 01:39:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:39:50,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:39:50,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:39:50,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:39:50,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 01:39:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:39:50,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 01:39:50,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:39:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:39:50,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:39:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 01:39:50,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711788452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:39:50,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:39:50,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-12-06 01:39:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274321127] [2022-12-06 01:39:50,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:39:50,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:39:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:39:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:39:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:39:50,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 45 [2022-12-06 01:39:50,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 1378 transitions, 24139 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:50,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:39:50,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 45 [2022-12-06 01:39:50,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:39:53,883 INFO L130 PetriNetUnfolder]: 8189/12681 cut-off events. [2022-12-06 01:39:53,883 INFO L131 PetriNetUnfolder]: For 24427/24463 co-relation queries the response was YES. [2022-12-06 01:39:53,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114986 conditions, 12681 events. 8189/12681 cut-off events. For 24427/24463 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 67557 event pairs, 78 based on Foata normal form. 0/12400 useless extension candidates. Maximal degree in co-relation 114951. Up to 10408 conditions per place. [2022-12-06 01:39:53,909 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 0 selfloop transitions, 0 changer transitions 1442/1442 dead transitions. [2022-12-06 01:39:53,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 1442 transitions, 28129 flow [2022-12-06 01:39:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:39:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:39:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 230 transitions. [2022-12-06 01:39:53,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-06 01:39:53,911 INFO L294 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2022-12-06 01:39:53,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:39:53,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 1442 transitions, 28129 flow [2022-12-06 01:39:54,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 1442 transitions, 28129 flow [2022-12-06 01:39:54,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 6526 [2022-12-06 01:39:54,021 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:39:54,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 01:39:54,022 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 1442 transitions, 28129 flow [2022-12-06 01:39:54,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:39:54,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 01:39:54,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 01:39:54,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 01:39:54,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 01:39:54,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-06 01:39:54,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 01:39:54,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 01:39:54,230 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-06 01:39:54,231 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:39:54,235 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:39:54,235 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:39:54,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:39:54 BasicIcfg [2022-12-06 01:39:54,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:39:54,238 INFO L158 Benchmark]: Toolchain (without parser) took 36218.48ms. Allocated memory was 183.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 157.5MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 01:39:54,239 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory was 160.3MB in the beginning and 160.2MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:39:54,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.60ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 126.9MB in the end (delta: 30.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 01:39:54,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.22ms. Allocated memory is still 183.5MB. Free memory was 126.9MB in the beginning and 124.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:39:54,239 INFO L158 Benchmark]: Boogie Preprocessor took 59.00ms. Allocated memory is still 183.5MB. Free memory was 124.2MB in the beginning and 121.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:39:54,239 INFO L158 Benchmark]: RCFGBuilder took 564.57ms. Allocated memory is still 183.5MB. Free memory was 121.6MB in the beginning and 100.1MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 01:39:54,240 INFO L158 Benchmark]: TraceAbstraction took 34969.26ms. Allocated memory was 183.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 99.0MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 01:39:54,241 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.14ms. Allocated memory is still 183.5MB. Free memory was 160.3MB in the beginning and 160.2MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 572.60ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 126.9MB in the end (delta: 30.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.22ms. Allocated memory is still 183.5MB. Free memory was 126.9MB in the beginning and 124.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.00ms. Allocated memory is still 183.5MB. Free memory was 124.2MB in the beginning and 121.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 564.57ms. Allocated memory is still 183.5MB. Free memory was 121.6MB in the beginning and 100.1MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 34969.26ms. Allocated memory was 183.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 99.0MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 147 PlacesBefore, 54 PlacesAfterwards, 149 TransitionsBefore, 51 TransitionsAfterwards, 8738 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 68 ConcurrentYvCompositions, 5 ChoiceCompositions, 111 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 6817, independent unconditional: 0, dependent: 241, dependent conditional: 241, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 0, independent unconditional: 6817, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 0, independent unconditional: 6817, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7058, independent: 6817, independent conditional: 0, independent unconditional: 6817, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5306, independent: 5229, independent conditional: 0, independent unconditional: 5229, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5306, independent: 5101, independent conditional: 0, independent unconditional: 5101, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 205, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 221, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7058, independent: 1588, independent conditional: 0, independent unconditional: 1588, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 5306, unknown conditional: 0, unknown unconditional: 5306] , Statistics on independence cache: Total cache size (in pairs): 9083, Positive cache size: 9006, Positive conditional cache size: 0, Positive unconditional cache size: 9006, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 50 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 1218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 353 TransitionsBefore, 353 TransitionsAfterwards, 2094 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 575 TransitionsBefore, 575 TransitionsAfterwards, 2974 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 339 TransitionsBefore, 339 TransitionsAfterwards, 2074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 471 TransitionsBefore, 471 TransitionsAfterwards, 2780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 662 TransitionsBefore, 662 TransitionsAfterwards, 3690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 1378 TransitionsBefore, 1378 TransitionsAfterwards, 6716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 1442 TransitionsBefore, 1442 TransitionsAfterwards, 6526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 6 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: 34.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 712 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2182 IncrementalHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 25 mSDtfsCounter, 2182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28129occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 5 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 20/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:39:54,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...