/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_29-multiple-protecting2-vesal_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:40:25,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:40:25,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:40:25,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:40:25,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:40:25,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:40:25,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:40:25,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:40:25,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:40:25,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:40:25,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:40:25,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:40:25,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:40:25,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:40:25,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:40:25,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:40:25,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:40:25,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:40:25,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:40:25,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:40:25,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:40:25,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:40:25,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:40:25,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:40:25,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:40:25,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:40:25,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:40:25,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:40:25,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:40:25,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:40:25,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:40:25,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:40:25,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:40:25,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:40:25,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:40:25,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:40:25,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:40:25,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:40:25,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:40:25,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:40:25,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:40:25,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:40:25,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:40:25,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:40:25,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:40:25,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:40:25,440 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:40:25,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:40:25,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:40:25,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:40:25,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:40:25,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:40:25,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:40:25,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:40:25,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:40:25,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:40:25,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:40:25,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:40:25,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:40:25,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:40:25,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:40:25,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:40:25,443 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-13 03:40:25,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:40:25,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:40:25,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:40:25,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:40:25,715 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:40:25,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-13 03:40:26,710 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:40:26,958 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:40:26,959 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-13 03:40:26,982 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01070d0e1/11669dd9ef7c42ce9ab7b56de247155f/FLAG11f7ce85c [2022-12-13 03:40:27,000 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01070d0e1/11669dd9ef7c42ce9ab7b56de247155f [2022-12-13 03:40:27,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:40:27,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:40:27,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:40:27,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:40:27,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:40:27,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e7e98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27, skipping insertion in model container [2022-12-13 03:40:27,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:40:27,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:40:27,151 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2022-12-13 03:40:27,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:40:27,272 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:40:27,280 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2022-12-13 03:40:27,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:40:27,343 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:40:27,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27 WrapperNode [2022-12-13 03:40:27,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:40:27,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:40:27,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:40:27,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:40:27,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,390 INFO L138 Inliner]: procedures = 162, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2022-12-13 03:40:27,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:40:27,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:40:27,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:40:27,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:40:27,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:40:27,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:40:27,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:40:27,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:40:27,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (1/1) ... [2022-12-13 03:40:27,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:40:27,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:40:27,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:40:27,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:40:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:40:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-13 03:40:27,501 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:40:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:40:27,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:40:27,502 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:40:27,672 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:40:27,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:40:27,872 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:40:27,877 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:40:27,877 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:40:27,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:27 BoogieIcfgContainer [2022-12-13 03:40:27,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:40:27,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:40:27,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:40:27,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:40:27,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:40:27" (1/3) ... [2022-12-13 03:40:27,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eee46ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:40:27, skipping insertion in model container [2022-12-13 03:40:27,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:27" (2/3) ... [2022-12-13 03:40:27,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eee46ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:40:27, skipping insertion in model container [2022-12-13 03:40:27,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:27" (3/3) ... [2022-12-13 03:40:27,884 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-13 03:40:27,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:40:27,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 03:40:27,903 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:40:27,964 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 03:40:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 101 transitions, 210 flow [2022-12-13 03:40:28,077 INFO L130 PetriNetUnfolder]: 3/100 cut-off events. [2022-12-13 03:40:28,077 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 03:40:28,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 100 events. 3/100 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-13 03:40:28,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 101 transitions, 210 flow [2022-12-13 03:40:28,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 86 transitions, 175 flow [2022-12-13 03:40:28,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:28,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 86 transitions, 175 flow [2022-12-13 03:40:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 86 transitions, 175 flow [2022-12-13 03:40:28,138 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-13 03:40:28,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:40:28,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-12-13 03:40:28,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 86 transitions, 175 flow [2022-12-13 03:40:28,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 03:40:31,014 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-13 03:40:31,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:40:31,036 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;@28fe8295, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:40:31,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:40:31,040 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 03:40:31,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:40:31,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:31,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 03:40:31,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 10514847, now seen corresponding path program 1 times [2022-12-13 03:40:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:31,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144530703] [2022-12-13 03:40:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:31,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:31,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144530703] [2022-12-13 03:40:31,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144530703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:31,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:31,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:40:31,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388011511] [2022-12-13 03:40:31,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:31,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:40:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:40:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:40:31,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 03:40:31,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 65 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:31,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:31,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 03:40:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:31,333 INFO L130 PetriNetUnfolder]: 96/251 cut-off events. [2022-12-13 03:40:31,333 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:40:31,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 251 events. 96/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 96 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 461. Up to 215 conditions per place. [2022-12-13 03:40:31,335 INFO L137 encePairwiseOnDemand]: 30/31 looper letters, 22 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-12-13 03:40:31,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:40:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:40:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-13 03:40:31,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161 [2022-12-13 03:40:31,347 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-13 03:40:31,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:31,352 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:31,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:31,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 03:40:31,392 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:31,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 03:40:31,397 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 107 flow [2022-12-13 03:40:31,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:31,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:31,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:40:31,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:40:31,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash 325897514, now seen corresponding path program 1 times [2022-12-13 03:40:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:31,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965427466] [2022-12-13 03:40:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:31,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965427466] [2022-12-13 03:40:31,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965427466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:31,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:31,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:40:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775345021] [2022-12-13 03:40:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:31,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:40:31,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:31,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:40:31,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:40:31,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 03:40:31,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:31,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:31,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 03:40:31,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:31,661 INFO L130 PetriNetUnfolder]: 98/256 cut-off events. [2022-12-13 03:40:31,661 INFO L131 PetriNetUnfolder]: For 26/35 co-relation queries the response was YES. [2022-12-13 03:40:31,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 256 events. 98/256 cut-off events. For 26/35 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1257 event pairs, 35 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 682. Up to 213 conditions per place. [2022-12-13 03:40:31,663 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 27 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 03:40:31,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:40:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:40:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 03:40:31,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-13 03:40:31,666 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-13 03:40:31,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:31,668 INFO L89 Accepts]: Start accepts. Operand has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:31,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:31,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 03:40:31,686 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:31,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:40:31,687 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 195 flow [2022-12-13 03:40:31,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:31,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:31,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:31,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:40:31,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash -345149871, now seen corresponding path program 1 times [2022-12-13 03:40:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:31,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92407762] [2022-12-13 03:40:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:31,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92407762] [2022-12-13 03:40:31,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92407762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:31,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:31,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:40:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816101505] [2022-12-13 03:40:31,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:31,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:40:31,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:40:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:40:31,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 03:40:31,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 195 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-13 03:40:31,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:31,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 03:40:31,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:31,854 INFO L130 PetriNetUnfolder]: 99/259 cut-off events. [2022-12-13 03:40:31,855 INFO L131 PetriNetUnfolder]: For 79/95 co-relation queries the response was YES. [2022-12-13 03:40:31,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 259 events. 99/259 cut-off events. For 79/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1200 event pairs, 26 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 919. Up to 219 conditions per place. [2022-12-13 03:40:31,857 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 40 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-12-13 03:40:31,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:40:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:40:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 03:40:31,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-13 03:40:31,859 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-13 03:40:31,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:31,863 INFO L89 Accepts]: Start accepts. Operand has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:31,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:31,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 03:40:31,874 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:31,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:40:31,875 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 57 transitions, 413 flow [2022-12-13 03:40:31,875 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-13 03:40:31,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:31,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:31,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:40:31,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1184720357, now seen corresponding path program 1 times [2022-12-13 03:40:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:31,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095794176] [2022-12-13 03:40:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:31,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:31,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095794176] [2022-12-13 03:40:31,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095794176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:31,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:31,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:40:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007638342] [2022-12-13 03:40:31,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:31,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:40:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:40:31,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:40:31,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 03:40:31,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 57 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:31,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:31,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 03:40:31,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:31,967 INFO L130 PetriNetUnfolder]: 68/213 cut-off events. [2022-12-13 03:40:31,967 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-13 03:40:31,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 213 events. 68/213 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 902 event pairs, 4 based on Foata normal form. 43/208 useless extension candidates. Maximal degree in co-relation 899. Up to 161 conditions per place. [2022-12-13 03:40:31,970 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 37 selfloop transitions, 19 changer transitions 10/69 dead transitions. [2022-12-13 03:40:31,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 629 flow [2022-12-13 03:40:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:40:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:40:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 03:40:31,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 03:40:31,973 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2022-12-13 03:40:31,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 69 transitions, 629 flow [2022-12-13 03:40:31,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 59 transitions, 541 flow [2022-12-13 03:40:31,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:31,975 INFO L89 Accepts]: Start accepts. Operand has 37 places, 59 transitions, 541 flow [2022-12-13 03:40:31,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:31,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:31,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 59 transitions, 541 flow [2022-12-13 03:40:31,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 59 transitions, 541 flow [2022-12-13 03:40:31,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-13 03:40:32,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:40:32,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 03:40:32,016 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 57 transitions, 521 flow [2022-12-13 03:40:32,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:32,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:40:32,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1925861862, now seen corresponding path program 1 times [2022-12-13 03:40:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:32,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220769468] [2022-12-13 03:40:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220769468] [2022-12-13 03:40:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220769468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:32,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:32,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:40:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270818165] [2022-12-13 03:40:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:32,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:40:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:32,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:40:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:40:32,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 03:40:32,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 57 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:32,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 03:40:32,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:32,143 INFO L130 PetriNetUnfolder]: 50/167 cut-off events. [2022-12-13 03:40:32,144 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-13 03:40:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 167 events. 50/167 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 667 event pairs, 4 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 841. Up to 129 conditions per place. [2022-12-13 03:40:32,145 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 42 selfloop transitions, 9 changer transitions 6/63 dead transitions. [2022-12-13 03:40:32,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 693 flow [2022-12-13 03:40:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:40:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:40:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-13 03:40:32,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-13 03:40:32,146 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-13 03:40:32,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 63 transitions, 693 flow [2022-12-13 03:40:32,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 57 transitions, 631 flow [2022-12-13 03:40:32,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:32,148 INFO L89 Accepts]: Start accepts. Operand has 40 places, 57 transitions, 631 flow [2022-12-13 03:40:32,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:32,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:32,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 57 transitions, 631 flow [2022-12-13 03:40:32,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 57 transitions, 631 flow [2022-12-13 03:40:32,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 03:40:32,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:40:32,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 03:40:32,210 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 57 transitions, 631 flow [2022-12-13 03:40:32,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:32,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:40:32,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 335306867, now seen corresponding path program 1 times [2022-12-13 03:40:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:32,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525942893] [2022-12-13 03:40:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:32,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525942893] [2022-12-13 03:40:32,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525942893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:32,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:32,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:40:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850505819] [2022-12-13 03:40:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:32,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:40:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:32,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:40:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:40:32,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-13 03:40:32,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 57 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-13 03:40:32,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:32,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-13 03:40:32,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:32,339 INFO L130 PetriNetUnfolder]: 39/137 cut-off events. [2022-12-13 03:40:32,339 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-13 03:40:32,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 137 events. 39/137 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 3 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 782. Up to 103 conditions per place. [2022-12-13 03:40:32,340 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 36 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2022-12-13 03:40:32,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 719 flow [2022-12-13 03:40:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:40:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:40:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-12-13 03:40:32,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.288 [2022-12-13 03:40:32,341 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-13 03:40:32,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 56 transitions, 719 flow [2022-12-13 03:40:32,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 56 transitions, 719 flow [2022-12-13 03:40:32,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:32,343 INFO L89 Accepts]: Start accepts. Operand has 48 places, 56 transitions, 719 flow [2022-12-13 03:40:32,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:32,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:32,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 56 transitions, 719 flow [2022-12-13 03:40:32,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 56 transitions, 719 flow [2022-12-13 03:40:32,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 03:40:32,398 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:40:32,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 03:40:32,399 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 53 transitions, 685 flow [2022-12-13 03:40:32,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-13 03:40:32,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:32,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:40:32,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash -400313073, now seen corresponding path program 1 times [2022-12-13 03:40:32,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919379772] [2022-12-13 03:40:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:32,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919379772] [2022-12-13 03:40:32,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919379772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:32,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:32,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:40:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729414732] [2022-12-13 03:40:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:32,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:40:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:32,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:40:32,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:40:32,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-13 03:40:32,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 53 transitions, 685 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:32,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-13 03:40:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:32,487 INFO L130 PetriNetUnfolder]: 44/159 cut-off events. [2022-12-13 03:40:32,487 INFO L131 PetriNetUnfolder]: For 429/429 co-relation queries the response was YES. [2022-12-13 03:40:32,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 159 events. 44/159 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 642 event pairs, 8 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 998. Up to 117 conditions per place. [2022-12-13 03:40:32,488 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 51 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2022-12-13 03:40:32,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:40:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:40:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 03:40:32,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 03:40:32,489 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-13 03:40:32,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:32,491 INFO L89 Accepts]: Start accepts. Operand has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:32,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:32,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:40:32,493 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:32,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 03:40:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 64 transitions, 955 flow [2022-12-13 03:40:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:32,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:40:32,494 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1043544816, now seen corresponding path program 1 times [2022-12-13 03:40:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:32,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003451983] [2022-12-13 03:40:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003451983] [2022-12-13 03:40:32,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003451983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:32,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:32,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:40:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27171478] [2022-12-13 03:40:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:32,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:40:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:32,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:40:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:40:32,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:40:32,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 64 transitions, 955 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:32,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:40:32,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:32,683 INFO L130 PetriNetUnfolder]: 23/108 cut-off events. [2022-12-13 03:40:32,683 INFO L131 PetriNetUnfolder]: For 297/297 co-relation queries the response was YES. [2022-12-13 03:40:32,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 108 events. 23/108 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 380 event pairs, 0 based on Foata normal form. 11/112 useless extension candidates. Maximal degree in co-relation 804. Up to 84 conditions per place. [2022-12-13 03:40:32,684 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 40 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2022-12-13 03:40:32,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 975 flow [2022-12-13 03:40:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 03:40:32,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33695652173913043 [2022-12-13 03:40:32,686 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-13 03:40:32,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 58 transitions, 975 flow [2022-12-13 03:40:32,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 58 transitions, 975 flow [2022-12-13 03:40:32,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:32,688 INFO L89 Accepts]: Start accepts. Operand has 49 places, 58 transitions, 975 flow [2022-12-13 03:40:32,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:32,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:32,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 58 transitions, 975 flow [2022-12-13 03:40:32,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 58 transitions, 975 flow [2022-12-13 03:40:32,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:40:32,834 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:40:32,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 03:40:32,835 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 56 transitions, 939 flow [2022-12-13 03:40:32,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:32,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:40:32,835 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 03:40:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1404870449, now seen corresponding path program 1 times [2022-12-13 03:40:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251422954] [2022-12-13 03:40:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:40:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:32,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251422954] [2022-12-13 03:40:32,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251422954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:32,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:32,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:40:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226225697] [2022-12-13 03:40:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:32,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:40:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:40:32,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:40:32,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 03:40:32,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 56 transitions, 939 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:32,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 03:40:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:32,933 INFO L130 PetriNetUnfolder]: 22/100 cut-off events. [2022-12-13 03:40:32,933 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-13 03:40:32,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 100 events. 22/100 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 372 event pairs, 0 based on Foata normal form. 6/99 useless extension candidates. Maximal degree in co-relation 805. Up to 76 conditions per place. [2022-12-13 03:40:32,933 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2022-12-13 03:40:32,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 999 flow [2022-12-13 03:40:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 03:40:32,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-13 03:40:32,934 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-13 03:40:32,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 54 transitions, 999 flow [2022-12-13 03:40:32,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:32,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:32,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:32,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:32,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:40:32,936 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:32,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:40:32,936 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:32,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:40:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-12-13 03:40:32,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-12-13 03:40:32,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:40:32,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:40:32,939 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,941 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:40:32,941 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:40:32,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:40:32 BasicIcfg [2022-12-13 03:40:32,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:40:32,943 INFO L158 Benchmark]: Toolchain (without parser) took 5940.52ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 155.2MB in the beginning and 181.0MB in the end (delta: -25.8MB). Peak memory consumption was 67.3MB. Max. memory is 8.0GB. [2022-12-13 03:40:32,943 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 158.6MB in the beginning and 158.5MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:40:32,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.32ms. Allocated memory is still 182.5MB. Free memory was 155.0MB in the beginning and 135.7MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 03:40:32,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.30ms. Allocated memory is still 182.5MB. Free memory was 135.7MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:40:32,943 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 182.5MB. Free memory was 133.7MB in the beginning and 132.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:40:32,944 INFO L158 Benchmark]: RCFGBuilder took 462.64ms. Allocated memory is still 182.5MB. Free memory was 131.9MB in the beginning and 117.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 03:40:32,944 INFO L158 Benchmark]: TraceAbstraction took 5062.09ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 116.2MB in the beginning and 181.0MB in the end (delta: -64.8MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2022-12-13 03:40:32,945 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.11ms. Allocated memory is still 182.5MB. Free memory was 158.6MB in the beginning and 158.5MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.32ms. Allocated memory is still 182.5MB. Free memory was 155.0MB in the beginning and 135.7MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.30ms. Allocated memory is still 182.5MB. Free memory was 135.7MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 182.5MB. Free memory was 133.7MB in the beginning and 132.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 462.64ms. Allocated memory is still 182.5MB. Free memory was 131.9MB in the beginning and 117.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5062.09ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 116.2MB in the beginning and 181.0MB in the end (delta: -64.8MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 88 PlacesBefore, 34 PlacesAfterwards, 86 TransitionsBefore, 31 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 30 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 1579, independent unconditional: 0, dependent: 184, dependent conditional: 184, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, independent: 900, independent conditional: 0, independent unconditional: 900, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, independent: 848, independent conditional: 0, independent unconditional: 848, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 108, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1763, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 1667, Positive cache size: 1611, Positive conditional cache size: 0, Positive unconditional cache size: 1611, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, 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, 35 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 37 PlacesBefore, 37 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 3, independent unconditional: 8, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 14, unknown conditional: 1, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 40, Positive conditional cache size: 1, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 17, dependent conditional: 10, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 42, Positive conditional cache size: 1, Positive unconditional cache size: 41, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 59 TransitionsBefore, 57 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 44, Positive conditional cache size: 1, Positive unconditional cache size: 43, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 44, Positive conditional cache size: 1, Positive unconditional cache size: 43, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 43 PlacesAfterwards, 56 TransitionsBefore, 53 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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): 62, Positive cache size: 44, Positive conditional cache size: 1, Positive unconditional cache size: 43, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 44, Positive conditional cache size: 1, Positive unconditional cache size: 43, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 46 PlacesAfterwards, 58 TransitionsBefore, 56 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 46, Positive conditional cache size: 1, Positive unconditional cache size: 45, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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 - 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 3 procedures, 119 locations, 4 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: 4.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 8 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=975occurred in iteration=8, InterpolantAutomatonStates: 42, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:40:32,963 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...