/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:57:29,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:57:29,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:57:29,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:57:29,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:57:29,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:57:29,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:57:29,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:57:29,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:57:29,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:57:29,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:57:29,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:57:29,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:57:29,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:57:29,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:57:29,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:57:29,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:57:29,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:57:29,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:57:29,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:57:29,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:57:29,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:57:29,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:57:29,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:57:29,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:57:29,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:57:29,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:57:29,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:57:29,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:57:29,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:57:29,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:57:29,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:57:29,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:57:29,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:57:29,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:57:29,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:57:29,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:57:29,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:57:29,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:57:29,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:57:29,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:57:29,990 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:57:30,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:57:30,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:57:30,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:57:30,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:57:30,040 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:57:30,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:57:30,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:57:30,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:57:30,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:57:30,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:57:30,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:57:30,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:57:30,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:57:30,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:57:30,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:57:30,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:57:30,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:57:30,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:57:30,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:57:30,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:57:30,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:57:30,044 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:57:30,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:57:30,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:57:30,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:57:30,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:57:30,333 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:57:30,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-13 03:57:31,337 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:57:31,526 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:57:31,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-13 03:57:31,533 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f857e798e/6673a2a558674cc383ecb8f5ba02b5fa/FLAG10fcfad86 [2022-12-13 03:57:31,549 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f857e798e/6673a2a558674cc383ecb8f5ba02b5fa [2022-12-13 03:57:31,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:57:31,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:57:31,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:57:31,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:57:31,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:57:31,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14fef4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31, skipping insertion in model container [2022-12-13 03:57:31,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:57:31,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:57:31,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-12-13 03:57:31,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:57:31,738 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:57:31,770 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-12-13 03:57:31,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:57:31,795 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:57:31,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31 WrapperNode [2022-12-13 03:57:31,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:57:31,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:57:31,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:57:31,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:57:31,803 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:57:31" (1/1) ... [2022-12-13 03:57:31,822 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:57:31" (1/1) ... [2022-12-13 03:57:31,857 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-12-13 03:57:31,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:57:31,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:57:31,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:57:31,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:57:31,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,885 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:57:31,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:57:31,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:57:31,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:57:31,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (1/1) ... [2022-12-13 03:57:31,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:57:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:57:31,940 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:57:31,959 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:57:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:57:31,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:57:31,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:57:31,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 03:57:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 03:57:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 03:57:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:57:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:57:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:57:31,975 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:57:32,111 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:57:32,112 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:57:32,502 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:57:32,510 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:57:32,510 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 03:57:32,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:57:32 BoogieIcfgContainer [2022-12-13 03:57:32,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:57:32,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:57:32,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:57:32,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:57:32,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:57:31" (1/3) ... [2022-12-13 03:57:32,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4219c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:57:32, skipping insertion in model container [2022-12-13 03:57:32,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:57:31" (2/3) ... [2022-12-13 03:57:32,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4219c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:57:32, skipping insertion in model container [2022-12-13 03:57:32,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:57:32" (3/3) ... [2022-12-13 03:57:32,534 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2022-12-13 03:57:32,546 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:57:32,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:57:32,546 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:57:32,708 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 03:57:32,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 341 transitions, 706 flow [2022-12-13 03:57:32,887 INFO L130 PetriNetUnfolder]: 26/338 cut-off events. [2022-12-13 03:57:32,888 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:57:32,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 26/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-13 03:57:32,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 341 transitions, 706 flow [2022-12-13 03:57:32,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 328 transitions, 674 flow [2022-12-13 03:57:32,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:32,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-13 03:57:32,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 328 transitions, 674 flow [2022-12-13 03:57:33,026 INFO L130 PetriNetUnfolder]: 26/328 cut-off events. [2022-12-13 03:57:33,026 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:57:33,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 328 events. 26/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 786 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-13 03:57:33,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-13 03:57:33,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 27528 [2022-12-13 03:57:44,733 INFO L241 LiptonReduction]: Total number of compositions: 304 [2022-12-13 03:57:44,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:57:44,748 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;@46a67fa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:57:44,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:57:44,752 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-13 03:57:44,752 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:57:44,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:44,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:44,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:57:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1174101351, now seen corresponding path program 1 times [2022-12-13 03:57:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:44,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868191414] [2022-12-13 03:57:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:45,006 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:57:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:45,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868191414] [2022-12-13 03:57:45,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868191414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:57:45,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:57:45,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:57:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785730590] [2022-12-13 03:57:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:57:45,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:57:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:57:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:57:45,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:57:45,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:57:45,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:45,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:57:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:57:45,117 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-13 03:57:45,117 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:57:45,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 328 events. 221/328 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 771 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 534. Up to 328 conditions per place. [2022-12-13 03:57:45,120 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 03:57:45,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 118 flow [2022-12-13 03:57:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:57:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:57:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 03:57:45,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 03:57:45,132 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-13 03:57:45,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 118 flow [2022-12-13 03:57:45,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 118 flow [2022-12-13 03:57:45,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:57:45,136 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 118 flow [2022-12-13 03:57:45,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:57:45,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:45,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 118 flow [2022-12-13 03:57:45,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 118 flow [2022-12-13 03:57:45,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:57:46,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:57:46,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1339 [2022-12-13 03:57:46,475 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 114 flow [2022-12-13 03:57:46,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:57:46,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:46,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:57:46,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:57:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash 920055315, now seen corresponding path program 1 times [2022-12-13 03:57:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:46,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497178573] [2022-12-13 03:57:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:46,557 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:57:46,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:46,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497178573] [2022-12-13 03:57:46,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497178573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:57:46,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:57:46,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:57:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812784880] [2022-12-13 03:57:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:57:46,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:57:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:57:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:57:46,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:57:46,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:57:46,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:46,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:57:46,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:57:46,656 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-13 03:57:46,656 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:57:46,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 328 events. 221/328 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 770 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 789. Up to 329 conditions per place. [2022-12-13 03:57:46,658 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 03:57:46,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 168 flow [2022-12-13 03:57:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:57:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:57:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 03:57:46,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 03:57:46,659 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-13 03:57:46,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 25 transitions, 168 flow [2022-12-13 03:57:46,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 25 transitions, 168 flow [2022-12-13 03:57:46,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:57:46,661 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 168 flow [2022-12-13 03:57:46,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:57:46,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:46,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 168 flow [2022-12-13 03:57:46,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 168 flow [2022-12-13 03:57:46,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:57:48,599 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:57:48,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1939 [2022-12-13 03:57:48,600 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 162 flow [2022-12-13 03:57:48,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:57:48,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:48,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:48,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:57:48,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:57:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 511231090, now seen corresponding path program 1 times [2022-12-13 03:57:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:48,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284950897] [2022-12-13 03:57:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:48,671 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:57:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:48,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284950897] [2022-12-13 03:57:48,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284950897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:57:48,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:57:48,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:57:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052656072] [2022-12-13 03:57:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:57:48,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:57:48,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:48,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:57:48,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:57:48,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:57:48,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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:57:48,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:48,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:57:48,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:57:48,743 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-13 03:57:48,744 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 03:57:48,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 328 events. 221/328 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 774 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 1044. Up to 329 conditions per place. [2022-12-13 03:57:48,745 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 03:57:48,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 218 flow [2022-12-13 03:57:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:57:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:57:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 03:57:48,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 03:57:48,749 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2022-12-13 03:57:48,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 25 transitions, 218 flow [2022-12-13 03:57:48,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 25 transitions, 218 flow [2022-12-13 03:57:48,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:57:48,751 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 218 flow [2022-12-13 03:57:48,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:57:48,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:48,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 218 flow [2022-12-13 03:57:48,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 218 flow [2022-12-13 03:57:48,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:57:50,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:57:50,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1916 [2022-12-13 03:57:50,667 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 210 flow [2022-12-13 03:57:50,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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:57:50,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:50,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:57:50,668 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:57:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -239969031, now seen corresponding path program 1 times [2022-12-13 03:57:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630715888] [2022-12-13 03:57:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:51,022 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:57:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:51,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630715888] [2022-12-13 03:57:51,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630715888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:57:51,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:57:51,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:57:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75786675] [2022-12-13 03:57:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:57:51,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:57:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:57:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:57:51,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:57:51,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 210 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:57:51,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:51,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:57:51,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:57:51,163 INFO L130 PetriNetUnfolder]: 365/538 cut-off events. [2022-12-13 03:57:51,163 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-13 03:57:51,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 538 events. 365/538 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1621 event pairs, 138 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 2121. Up to 539 conditions per place. [2022-12-13 03:57:51,166 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 2 changer transitions 15/51 dead transitions. [2022-12-13 03:57:51,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 546 flow [2022-12-13 03:57:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:57:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:57:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 03:57:51,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-13 03:57:51,168 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-13 03:57:51,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 51 transitions, 546 flow [2022-12-13 03:57:51,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 36 transitions, 384 flow [2022-12-13 03:57:51,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:57:51,172 INFO L89 Accepts]: Start accepts. Operand has 35 places, 36 transitions, 384 flow [2022-12-13 03:57:51,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:57:51,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:51,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 36 transitions, 384 flow [2022-12-13 03:57:51,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 36 transitions, 384 flow [2022-12-13 03:57:51,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:57:51,174 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:57:51,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 03:57:51,175 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 384 flow [2022-12-13 03:57:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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:57:51,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:51,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:57:51,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:57:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -348065898, now seen corresponding path program 1 times [2022-12-13 03:57:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:51,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352129715] [2022-12-13 03:57:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:57:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352129715] [2022-12-13 03:57:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352129715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:57:51,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:57:51,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:57:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876520229] [2022-12-13 03:57:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:57:51,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:57:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:57:51,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:57:51,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:57:51,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 384 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:57:51,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:51,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:57:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:57:51,646 INFO L130 PetriNetUnfolder]: 500/735 cut-off events. [2022-12-13 03:57:51,646 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 03:57:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 735 events. 500/735 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2499 event pairs, 138 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3410. Up to 736 conditions per place. [2022-12-13 03:57:51,650 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 51 selfloop transitions, 5 changer transitions 27/83 dead transitions. [2022-12-13 03:57:51,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 83 transitions, 1050 flow [2022-12-13 03:57:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:57:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:57:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-13 03:57:51,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 03:57:51,652 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-13 03:57:51,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 83 transitions, 1050 flow [2022-12-13 03:57:51,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 56 transitions, 705 flow [2022-12-13 03:57:51,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:57:51,658 INFO L89 Accepts]: Start accepts. Operand has 38 places, 56 transitions, 705 flow [2022-12-13 03:57:51,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:57:51,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:51,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 56 transitions, 705 flow [2022-12-13 03:57:51,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 56 transitions, 705 flow [2022-12-13 03:57:51,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:57:51,660 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:57:51,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 03:57:51,661 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 56 transitions, 705 flow [2022-12-13 03:57:51,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:57:51,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:51,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:51,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:57:51,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:57:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1462332081, now seen corresponding path program 1 times [2022-12-13 03:57:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:51,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055767468] [2022-12-13 03:57:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:57:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055767468] [2022-12-13 03:57:52,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055767468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:57:52,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610590345] [2022-12-13 03:57:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:57:52,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:57:52,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:57:52,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 03:57:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:52,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 03:57:52,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:57:53,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 150 [2022-12-13 03:57:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:57:53,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:57:54,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:57:54,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 110 [2022-12-13 03:57:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:57:54,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610590345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:57:54,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:57:54,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 29 [2022-12-13 03:57:54,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388849344] [2022-12-13 03:57:54,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:57:54,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 03:57:54,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:54,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 03:57:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2022-12-13 03:57:54,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:57:54,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 56 transitions, 705 flow. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 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:57:54,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:54,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:57:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:09,149 INFO L130 PetriNetUnfolder]: 2323/3624 cut-off events. [2022-12-13 03:58:09,150 INFO L131 PetriNetUnfolder]: For 607/607 co-relation queries the response was YES. [2022-12-13 03:58:09,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25836 conditions, 3624 events. 2323/3624 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18873 event pairs, 94 based on Foata normal form. 10/2623 useless extension candidates. Maximal degree in co-relation 22868. Up to 3625 conditions per place. [2022-12-13 03:58:09,209 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 555 selfloop transitions, 192 changer transitions 58/805 dead transitions. [2022-12-13 03:58:09,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 805 transitions, 11834 flow [2022-12-13 03:58:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-12-13 03:58:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2022-12-13 03:58:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 747 transitions. [2022-12-13 03:58:09,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3497191011235955 [2022-12-13 03:58:09,216 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2022-12-13 03:58:09,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 805 transitions, 11834 flow [2022-12-13 03:58:09,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 747 transitions, 10944 flow [2022-12-13 03:58:09,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:09,300 INFO L89 Accepts]: Start accepts. Operand has 120 places, 747 transitions, 10944 flow [2022-12-13 03:58:09,321 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:09,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:09,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 747 transitions, 10944 flow [2022-12-13 03:58:09,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 747 transitions, 10944 flow [2022-12-13 03:58:09,352 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:09,354 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:09,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 03:58:09,356 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 747 transitions, 10944 flow [2022-12-13 03:58:09,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 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:58:09,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:09,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:09,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 03:58:09,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 03:58:09,562 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 645049271, now seen corresponding path program 2 times [2022-12-13 03:58:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340278207] [2022-12-13 03:58:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:10,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340278207] [2022-12-13 03:58:10,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340278207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:58:10,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685042033] [2022-12-13 03:58:10,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:58:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:58:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:58:10,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:58:10,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 03:58:10,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:58:10,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:58:10,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 03:58:10,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:58:10,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 100 [2022-12-13 03:58:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:11,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:58:11,545 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-13 03:58:11,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 99 [2022-12-13 03:58:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:11,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685042033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:58:11,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:58:11,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2022-12-13 03:58:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717731780] [2022-12-13 03:58:11,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:58:11,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 03:58:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 03:58:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-12-13 03:58:11,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:58:11,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 747 transitions, 10944 flow. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 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:58:11,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:11,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:58:11,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:18,798 INFO L130 PetriNetUnfolder]: 5449/8696 cut-off events. [2022-12-13 03:58:18,799 INFO L131 PetriNetUnfolder]: For 1579/1579 co-relation queries the response was YES. [2022-12-13 03:58:18,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70674 conditions, 8696 events. 5449/8696 cut-off events. For 1579/1579 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 55382 event pairs, 92 based on Foata normal form. 9/6244 useless extension candidates. Maximal degree in co-relation 61866. Up to 8697 conditions per place. [2022-12-13 03:58:18,847 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 1762 selfloop transitions, 616 changer transitions 168/2546 dead transitions. [2022-12-13 03:58:18,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 2546 transitions, 42398 flow [2022-12-13 03:58:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 03:58:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-13 03:58:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 483 transitions. [2022-12-13 03:58:18,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.359375 [2022-12-13 03:58:18,850 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2022-12-13 03:58:18,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 2546 transitions, 42398 flow [2022-12-13 03:58:18,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 2378 transitions, 39578 flow [2022-12-13 03:58:18,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:18,941 INFO L89 Accepts]: Start accepts. Operand has 161 places, 2378 transitions, 39578 flow [2022-12-13 03:58:18,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:18,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:18,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 2378 transitions, 39578 flow [2022-12-13 03:58:19,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 2378 transitions, 39578 flow [2022-12-13 03:58:19,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:19,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] $Ultimate##0-->L53-4: Formula: (let ((.cse0 (= v_~name_1~0_31 v_~name_2~0_31))) (and (= v_~break_7~0_53 (ite .cse0 1 0)) (= v_~i_5~0_33 0) (= v_~result_4~0_44 (ite .cse0 0 v_~result_4~0_45)))) InVars {~name_2~0=v_~name_2~0_31, ~result_4~0=v_~result_4~0_45, ~name_1~0=v_~name_1~0_31} OutVars{~break_7~0=v_~break_7~0_53, ~name_2~0=v_~name_2~0_31, ~result_4~0=v_~result_4~0_44, ~name_1~0=v_~name_1~0_31, ~i_5~0=v_~i_5~0_33} AuxVars[] AssignedVars[~break_7~0, ~result_4~0, ~i_5~0] and [1187] L135-4-->L136-3: Formula: (and (= |v_#pthreadsForks_29| |v_ULTIMATE.start_main_#t~pre36#1_21|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t3~0#1.base_17| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t3~0#1.base_17|) |v_ULTIMATE.start_main_~#t3~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre36#1_21|)) |v_#memory_int_53|) (= (+ |v_#pthreadsForks_29| 1) |v_#pthreadsForks_28|)) InVars {#pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_17|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~pre36#1=|v_ULTIMATE.start_main_#t~pre36#1_21|, #pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_17|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_11|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_17|, ULTIMATE.start_main_#t~pre34#1=|v_ULTIMATE.start_main_#t~pre34#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre36#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet35#1, #memory_int, ULTIMATE.start_main_#t~pre34#1] [2022-12-13 03:58:19,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:58:19,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 03:58:19,068 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 2377 transitions, 39564 flow [2022-12-13 03:58:19,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 26 states have internal predecessors, (66), 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:58:19,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:19,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:19,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 03:58:19,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 03:58:19,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1034442831, now seen corresponding path program 3 times [2022-12-13 03:58:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:19,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993367815] [2022-12-13 03:58:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:20,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993367815] [2022-12-13 03:58:20,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993367815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:58:20,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301333664] [2022-12-13 03:58:20,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 03:58:20,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:58:20,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:58:20,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:58:20,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 03:58:20,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 03:58:20,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:58:20,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 03:58:20,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:58:20,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:58:20,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-13 03:58:20,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 131 [2022-12-13 03:58:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:20,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:58:21,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:58:21,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 99 [2022-12-13 03:58:21,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-13 03:58:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301333664] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:58:22,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:58:22,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2022-12-13 03:58:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907140204] [2022-12-13 03:58:22,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:58:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 03:58:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 03:58:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=937, Unknown=4, NotChecked=0, Total=1056 [2022-12-13 03:58:22,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:58:22,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 2377 transitions, 39564 flow. Second operand has 33 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 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:58:22,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:22,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:58:22,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:58:38,307 INFO L130 PetriNetUnfolder]: 11499/18402 cut-off events. [2022-12-13 03:58:38,307 INFO L131 PetriNetUnfolder]: For 3389/3389 co-relation queries the response was YES. [2022-12-13 03:58:38,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167857 conditions, 18402 events. 11499/18402 cut-off events. For 3389/3389 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 132907 event pairs, 127 based on Foata normal form. 34/12945 useless extension candidates. Maximal degree in co-relation 145922. Up to 18403 conditions per place. [2022-12-13 03:58:38,498 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 4447 selfloop transitions, 1550 changer transitions 323/6320 dead transitions. [2022-12-13 03:58:38,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 6320 transitions, 117764 flow [2022-12-13 03:58:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-13 03:58:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-13 03:58:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 565 transitions. [2022-12-13 03:58:38,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3183098591549296 [2022-12-13 03:58:38,504 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2022-12-13 03:58:38,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 6320 transitions, 117764 flow [2022-12-13 03:58:38,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 5997 transitions, 111623 flow [2022-12-13 03:58:38,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:58:38,756 INFO L89 Accepts]: Start accepts. Operand has 226 places, 5997 transitions, 111623 flow [2022-12-13 03:58:38,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:58:38,788 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:58:38,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 5997 transitions, 111623 flow [2022-12-13 03:58:38,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 5997 transitions, 111623 flow [2022-12-13 03:58:38,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:58:38,939 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:58:38,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 03:58:38,939 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 5997 transitions, 111623 flow [2022-12-13 03:58:38,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 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:58:38,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:58:38,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:58:38,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 03:58:39,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:58:39,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:58:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:58:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2035855605, now seen corresponding path program 1 times [2022-12-13 03:58:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:58:39,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001539970] [2022-12-13 03:58:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:58:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:58:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001539970] [2022-12-13 03:58:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001539970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:58:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254013520] [2022-12-13 03:58:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:58:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:58:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:58:39,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:58:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 03:58:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:58:39,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 03:58:39,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:58:40,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:58:40,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-13 03:58:40,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 84 [2022-12-13 03:58:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:40,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:58:41,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:58:41,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 89 [2022-12-13 03:58:41,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-12-13 03:58:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:58:41,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254013520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:58:41,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:58:41,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 03:58:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666902551] [2022-12-13 03:58:41,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:58:41,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 03:58:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:58:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 03:58:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=877, Unknown=6, NotChecked=0, Total=992 [2022-12-13 03:58:41,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:58:41,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 5997 transitions, 111623 flow. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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:58:41,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:58:41,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:58:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:02,020 INFO L130 PetriNetUnfolder]: 12544/20360 cut-off events. [2022-12-13 03:59:02,020 INFO L131 PetriNetUnfolder]: For 3901/3901 co-relation queries the response was YES. [2022-12-13 03:59:02,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206120 conditions, 20360 events. 12544/20360 cut-off events. For 3901/3901 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 152764 event pairs, 192 based on Foata normal form. 22/14555 useless extension candidates. Maximal degree in co-relation 176754. Up to 20361 conditions per place. [2022-12-13 03:59:02,250 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 5836 selfloop transitions, 1113 changer transitions 235/7184 dead transitions. [2022-12-13 03:59:02,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 7184 transitions, 148269 flow [2022-12-13 03:59:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 03:59:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 03:59:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 298 transitions. [2022-12-13 03:59:02,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35058823529411764 [2022-12-13 03:59:02,259 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2022-12-13 03:59:02,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 7184 transitions, 148269 flow [2022-12-13 03:59:02,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 6949 transitions, 143305 flow [2022-12-13 03:59:02,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:02,491 INFO L89 Accepts]: Start accepts. Operand has 255 places, 6949 transitions, 143305 flow [2022-12-13 03:59:02,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:02,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:02,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 6949 transitions, 143305 flow [2022-12-13 03:59:02,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 6949 transitions, 143305 flow [2022-12-13 03:59:02,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:02,709 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:02,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 03:59:02,710 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 6949 transitions, 143305 flow [2022-12-13 03:59:02,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 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:59:02,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:02,711 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:02,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 03:59:02,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:59:02,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash 30127328, now seen corresponding path program 2 times [2022-12-13 03:59:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:02,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913539113] [2022-12-13 03:59:02,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:03,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913539113] [2022-12-13 03:59:03,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913539113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:59:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832295417] [2022-12-13 03:59:03,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:59:03,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:59:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:59:03,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:59:03,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 03:59:03,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:59:03,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:59:03,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 03:59:03,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:59:03,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 03:59:03,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 03:59:04,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 61 [2022-12-13 03:59:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:04,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:59:04,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:59:04,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 99 [2022-12-13 03:59:04,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-12-13 03:59:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:04,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832295417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:59:04,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:59:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-12-13 03:59:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710664263] [2022-12-13 03:59:04,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:59:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 03:59:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 03:59:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2022-12-13 03:59:04,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:59:04,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 6949 transitions, 143305 flow. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:59:04,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:04,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:59:04,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:59:28,419 INFO L130 PetriNetUnfolder]: 12583/20406 cut-off events. [2022-12-13 03:59:28,420 INFO L131 PetriNetUnfolder]: For 3800/3800 co-relation queries the response was YES. [2022-12-13 03:59:28,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226957 conditions, 20406 events. 12583/20406 cut-off events. For 3800/3800 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 152769 event pairs, 198 based on Foata normal form. 16/14631 useless extension candidates. Maximal degree in co-relation 195510. Up to 20407 conditions per place. [2022-12-13 03:59:28,546 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 6550 selfloop transitions, 394 changer transitions 276/7220 dead transitions. [2022-12-13 03:59:28,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 7220 transitions, 163351 flow [2022-12-13 03:59:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:59:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:59:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2022-12-13 03:59:28,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3507692307692308 [2022-12-13 03:59:28,548 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2022-12-13 03:59:28,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 7220 transitions, 163351 flow [2022-12-13 03:59:28,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 6944 transitions, 157091 flow [2022-12-13 03:59:28,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:59:28,818 INFO L89 Accepts]: Start accepts. Operand has 260 places, 6944 transitions, 157091 flow [2022-12-13 03:59:28,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:59:28,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:59:28,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 6944 transitions, 157091 flow [2022-12-13 03:59:29,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 6944 transitions, 157091 flow [2022-12-13 03:59:29,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:59:29,066 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:59:29,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 03:59:29,067 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 6944 transitions, 157091 flow [2022-12-13 03:59:29,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:59:29,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:59:29,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:59:29,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 03:59:29,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 03:59:29,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:59:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:59:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1932219993, now seen corresponding path program 4 times [2022-12-13 03:59:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:59:29,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033688117] [2022-12-13 03:59:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:59:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:59:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:59:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:59:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033688117] [2022-12-13 03:59:30,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033688117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:59:30,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407632368] [2022-12-13 03:59:30,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 03:59:30,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:59:30,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:59:30,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 03:59:30,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 03:59:30,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 03:59:30,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:59:30,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 03:59:30,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:59:30,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2022-12-13 03:59:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:30,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:59:31,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:59:31,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 109 [2022-12-13 03:59:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:59:31,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407632368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:59:31,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:59:31,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-12-13 03:59:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129605514] [2022-12-13 03:59:31,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:59:31,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 03:59:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:59:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 03:59:31,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-12-13 03:59:31,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:59:31,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 6944 transitions, 157091 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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:59:31,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:59:31,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:59:31,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:00:18,197 INFO L130 PetriNetUnfolder]: 20365/33573 cut-off events. [2022-12-13 04:00:18,197 INFO L131 PetriNetUnfolder]: For 6896/6896 co-relation queries the response was YES. [2022-12-13 04:00:18,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406897 conditions, 33573 events. 20365/33573 cut-off events. For 6896/6896 co-relation queries the response was YES. Maximal size of possible extension queue 1856. Compared 276589 event pairs, 30 based on Foata normal form. 3/23933 useless extension candidates. Maximal degree in co-relation 348051. Up to 33574 conditions per place. [2022-12-13 04:00:18,513 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 10588 selfloop transitions, 2765 changer transitions 22/13375 dead transitions. [2022-12-13 04:00:18,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 13375 transitions, 329541 flow [2022-12-13 04:00:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 04:00:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-13 04:00:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 283 transitions. [2022-12-13 04:00:18,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2947916666666667 [2022-12-13 04:00:18,523 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2022-12-13 04:00:18,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 13375 transitions, 329541 flow [2022-12-13 04:00:18,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 13353 transitions, 328986 flow [2022-12-13 04:00:19,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:00:19,082 INFO L89 Accepts]: Start accepts. Operand has 297 places, 13353 transitions, 328986 flow [2022-12-13 04:00:19,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:00:19,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:00:19,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 13353 transitions, 328986 flow [2022-12-13 04:00:19,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 13353 transitions, 328986 flow [2022-12-13 04:00:19,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:00:19,799 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:00:19,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 718 [2022-12-13 04:00:19,800 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 13353 transitions, 328986 flow [2022-12-13 04:00:19,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 26 states have internal predecessors, (54), 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 04:00:19,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:00:19,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:00:19,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 04:00:20,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:00:20,005 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:00:20,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:00:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash 350341212, now seen corresponding path program 1 times [2022-12-13 04:00:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:00:20,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222757825] [2022-12-13 04:00:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:00:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:00:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:00:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:00:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:00:20,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222757825] [2022-12-13 04:00:20,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222757825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:00:20,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191317309] [2022-12-13 04:00:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:00:20,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:00:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:00:20,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:00:20,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 04:00:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:00:20,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 04:00:20,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:00:21,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 88 [2022-12-13 04:00:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:00:21,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:00:21,661 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-13 04:00:21,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 99 [2022-12-13 04:00:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:00:21,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191317309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:00:21,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:00:21,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2022-12-13 04:00:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089026344] [2022-12-13 04:00:21,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:00:21,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:00:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:00:21,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:00:21,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-12-13 04:00:21,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 04:00:21,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 13353 transitions, 328986 flow. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:00:21,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:00:21,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 04:00:21,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:02:25,569 INFO L130 PetriNetUnfolder]: 22383/36932 cut-off events. [2022-12-13 04:02:25,570 INFO L131 PetriNetUnfolder]: For 7760/7760 co-relation queries the response was YES. [2022-12-13 04:02:25,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484521 conditions, 36932 events. 22383/36932 cut-off events. For 7760/7760 co-relation queries the response was YES. Maximal size of possible extension queue 2062. Compared 308455 event pairs, 46 based on Foata normal form. 35/26330 useless extension candidates. Maximal degree in co-relation 413136. Up to 36933 conditions per place. [2022-12-13 04:02:25,819 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 13529 selfloop transitions, 996 changer transitions 98/14623 dead transitions. [2022-12-13 04:02:25,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 14623 transitions, 389471 flow [2022-12-13 04:02:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 04:02:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 04:02:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-12-13 04:02:25,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2022-12-13 04:02:25,820 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 281 predicate places. [2022-12-13 04:02:25,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 14623 transitions, 389471 flow [2022-12-13 04:02:26,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 14525 transitions, 386818 flow [2022-12-13 04:02:26,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:02:26,572 INFO L89 Accepts]: Start accepts. Operand has 311 places, 14525 transitions, 386818 flow [2022-12-13 04:02:26,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:02:26,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:02:26,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 14525 transitions, 386818 flow [2022-12-13 04:02:27,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 14525 transitions, 386818 flow [2022-12-13 04:02:27,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:02:27,440 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:02:27,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 869 [2022-12-13 04:02:27,441 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 14525 transitions, 386818 flow [2022-12-13 04:02:27,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:02:27,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:02:27,442 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:02:27,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 04:02:27,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:02:27,647 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:02:27,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:02:27,647 INFO L85 PathProgramCache]: Analyzing trace with hash -635637569, now seen corresponding path program 5 times [2022-12-13 04:02:27,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:02:27,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672332041] [2022-12-13 04:02:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:02:27,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:02:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:02:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:02:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:02:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672332041] [2022-12-13 04:02:28,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672332041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:02:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390939415] [2022-12-13 04:02:28,383 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 04:02:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:02:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:02:28,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:02:28,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 04:02:28,487 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:02:28,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:02:28,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 04:02:28,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:02:28,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 94 [2022-12-13 04:02:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:02:29,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:02:29,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:02:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 96 [2022-12-13 04:02:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:02:30,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390939415] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:02:30,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:02:30,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-12-13 04:02:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008068576] [2022-12-13 04:02:30,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:02:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 04:02:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:02:30,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 04:02:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2022-12-13 04:02:30,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 04:02:30,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 14525 transitions, 386818 flow. Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 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 04:02:30,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:02:30,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 04:02:30,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:06:46,836 INFO L130 PetriNetUnfolder]: 39638/65562 cut-off events. [2022-12-13 04:06:46,836 INFO L131 PetriNetUnfolder]: For 14127/14127 co-relation queries the response was YES. [2022-12-13 04:06:46,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925844 conditions, 65562 events. 39638/65562 cut-off events. For 14127/14127 co-relation queries the response was YES. Maximal size of possible extension queue 3563. Compared 593900 event pairs, 66 based on Foata normal form. 78/46624 useless extension candidates. Maximal degree in co-relation 784087. Up to 65563 conditions per place. [2022-12-13 04:06:47,400 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 21456 selfloop transitions, 3759 changer transitions 1059/26274 dead transitions. [2022-12-13 04:06:47,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 26274 transitions, 752826 flow [2022-12-13 04:06:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 04:06:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-13 04:06:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 422 transitions. [2022-12-13 04:06:47,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40891472868217055 [2022-12-13 04:06:47,401 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 323 predicate places. [2022-12-13 04:06:47,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 26274 transitions, 752826 flow [2022-12-13 04:06:48,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 340 places, 25215 transitions, 722106 flow [2022-12-13 04:06:48,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:06:48,914 INFO L89 Accepts]: Start accepts. Operand has 340 places, 25215 transitions, 722106 flow [2022-12-13 04:06:49,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:06:49,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:06:49,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 25215 transitions, 722106 flow [2022-12-13 04:06:50,740 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 25215 transitions, 722106 flow [2022-12-13 04:06:50,740 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:06:50,786 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:06:50,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1873 [2022-12-13 04:06:50,786 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 25215 transitions, 722106 flow [2022-12-13 04:06:50,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 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 04:06:50,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:06:50,787 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:06:50,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 04:06:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 04:06:50,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:06:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:06:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -707589684, now seen corresponding path program 6 times [2022-12-13 04:06:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:06:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86944261] [2022-12-13 04:06:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:06:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:06:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:06:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:06:52,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86944261] [2022-12-13 04:06:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86944261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:06:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659135772] [2022-12-13 04:06:52,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 04:06:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:06:52,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:06:52,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:06:52,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 04:06:52,264 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 04:06:52,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:06:52,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 04:06:52,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:06:52,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 78 [2022-12-13 04:06:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:52,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:06:53,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:06:53,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 71 [2022-12-13 04:06:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:06:53,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659135772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:06:53,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:06:53,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28 [2022-12-13 04:06:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711071807] [2022-12-13 04:06:53,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:06:53,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 04:06:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:06:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 04:06:53,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-12-13 04:06:53,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 04:06:53,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 25215 transitions, 722106 flow. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:06:53,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:06:53,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 04:06:53,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:11:30,401 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:11:30,401 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:11:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 04:11:30,433 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 04:11:30,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 04:11:30,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 04:11:30,638 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/24 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 665705 conditions, 44109 events (29536/44108 cut-off events. For 7543/7543 co-relation queries the response was YES. Maximal size of possible extension queue 4196. Compared 357668 event pairs, 58 based on Foata normal form. 0/33699 useless extension candidates. Maximal degree in co-relation 639007. Up to 44109 conditions per place.). [2022-12-13 04:11:30,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 04:11:30,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 04:11:30,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 04:11:30,640 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:30,642 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:11:30,642 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:11:30,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:11:30 BasicIcfg [2022-12-13 04:11:30,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:11:30,644 INFO L158 Benchmark]: Toolchain (without parser) took 839092.76ms. Allocated memory was 204.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 180.4MB in the beginning and 343.1MB in the end (delta: -162.7MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 04:11:30,644 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 180.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:11:30,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.81ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 167.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 04:11:30,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.47ms. Allocated memory is still 204.5MB. Free memory was 167.6MB in the beginning and 165.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 04:11:30,645 INFO L158 Benchmark]: Boogie Preprocessor took 41.86ms. Allocated memory is still 204.5MB. Free memory was 165.0MB in the beginning and 162.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:11:30,645 INFO L158 Benchmark]: RCFGBuilder took 627.68ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 137.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 04:11:30,645 INFO L158 Benchmark]: TraceAbstraction took 838113.87ms. Allocated memory was 204.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 136.2MB in the beginning and 343.1MB in the end (delta: -207.0MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-13 04:11:30,646 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.10ms. Allocated memory is still 204.5MB. Free memory is still 180.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.81ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 167.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.47ms. Allocated memory is still 204.5MB. Free memory was 167.6MB in the beginning and 165.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.86ms. Allocated memory is still 204.5MB. Free memory was 165.0MB in the beginning and 162.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 627.68ms. Allocated memory is still 204.5MB. Free memory was 162.9MB in the beginning and 137.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 838113.87ms. Allocated memory was 204.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 136.2MB in the beginning and 343.1MB in the end (delta: -207.0MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 312 PlacesBefore, 30 PlacesAfterwards, 328 TransitionsBefore, 24 TransitionsAfterwards, 27528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 111 TrivialYvCompositions, 171 ConcurrentYvCompositions, 22 ChoiceCompositions, 304 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 17605, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17613, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15631, unknown conditional: 0, unknown unconditional: 15631] , Statistics on independence cache: Total cache size (in pairs): 33839, Positive cache size: 33831, Positive conditional cache size: 0, Positive unconditional cache size: 33831, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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: 1.3s, 32 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 33 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 34 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 36 TransitionsBefore, 36 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 56 TransitionsBefore, 56 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 747 TransitionsBefore, 747 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 161 PlacesBefore, 160 PlacesAfterwards, 2378 TransitionsBefore, 2377 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 226 PlacesBefore, 226 PlacesAfterwards, 5997 TransitionsBefore, 5997 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 255 PlacesBefore, 255 PlacesAfterwards, 6949 TransitionsBefore, 6949 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 260 PlacesBefore, 260 PlacesAfterwards, 6944 TransitionsBefore, 6944 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 297 PlacesBefore, 297 PlacesAfterwards, 13353 TransitionsBefore, 13353 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 311 PlacesBefore, 311 PlacesAfterwards, 14525 TransitionsBefore, 14525 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 340 PlacesBefore, 340 PlacesAfterwards, 25215 TransitionsBefore, 25215 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/24 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 665705 conditions, 44109 events (29536/44108 cut-off events. For 7543/7543 co-relation queries the response was YES. Maximal size of possible extension queue 4196. Compared 357668 event pairs, 58 based on Foata normal form. 0/33699 useless extension candidates. Maximal degree in co-relation 639007. Up to 44109 conditions per place.). - TimeoutResultAtElement [Line: 136]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/24 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 665705 conditions, 44109 events (29536/44108 cut-off events. For 7543/7543 co-relation queries the response was YES. Maximal size of possible extension queue 4196. Compared 357668 event pairs, 58 based on Foata normal form. 0/33699 useless extension candidates. Maximal degree in co-relation 639007. Up to 44109 conditions per place.). - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/24 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 665705 conditions, 44109 events (29536/44108 cut-off events. For 7543/7543 co-relation queries the response was YES. Maximal size of possible extension queue 4196. Compared 357668 event pairs, 58 based on Foata normal form. 0/33699 useless extension candidates. Maximal degree in co-relation 639007. Up to 44109 conditions per place.). - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (28states, 0/24 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 665705 conditions, 44109 events (29536/44108 cut-off events. For 7543/7543 co-relation queries the response was YES. Maximal size of possible extension queue 4196. Compared 357668 event pairs, 58 based on Foata normal form. 0/33699 useless extension candidates. Maximal degree in co-relation 639007. Up to 44109 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 487 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: 837.9s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 789.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4360 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4360 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 564 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19654 IncrementalHoareTripleChecker+Invalid, 20218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 564 mSolverCounterUnsat, 0 mSDtfsCounter, 19654 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 946 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10871 ImplicationChecksByTransitivity, 40.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722106occurred in iteration=13, InterpolantAutomatonStates: 379, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 666 ConstructedInterpolants, 5 QuantifiedInterpolants, 11505 SizeOfPredicates, 439 NumberOfNonLiveVariables, 2373 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 15/70 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown