/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:41:31,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:41:31,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:41:31,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:41:31,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:41:31,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:41:31,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:41:31,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:41:31,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:41:31,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:41:31,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:41:31,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:41:31,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:41:31,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:41:31,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:41:31,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:41:31,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:41:31,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:41:31,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:41:31,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:41:31,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:41:31,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:41:31,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:41:31,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:41:31,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:41:31,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:41:31,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:41:31,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:41:31,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:41:31,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:41:31,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:41:31,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:41:31,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:41:31,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:41:31,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:41:31,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:41:31,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:41:31,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:41:31,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:41:31,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:41:31,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:41:31,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:41:31,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:41:31,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:41:31,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:41:31,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:41:31,627 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:41:31,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:41:31,628 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:41:31,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:41:31,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:41:31,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:41:31,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:41:31,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:41:31,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:41:31,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:41:31,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:41:31,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:41:31,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:41:31,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:41:31,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:41:31,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:41:31,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:41:31,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:41:31,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:41:31,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:41:31,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:41:31,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:41:31,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:41:31,632 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:41:31,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:41:31,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:41:31,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:41:31,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:41:31,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:41:31,981 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:41:31,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2022-12-06 01:41:33,129 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:41:33,382 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:41:33,382 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2022-12-06 01:41:33,395 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd8c08a7/e3b38ec5091341bdadf5001e59668afb/FLAG312b7f535 [2022-12-06 01:41:33,410 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd8c08a7/e3b38ec5091341bdadf5001e59668afb [2022-12-06 01:41:33,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:41:33,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:41:33,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:41:33,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:41:33,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:41:33,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@caad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33, skipping insertion in model container [2022-12-06 01:41:33,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:41:33,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:41:33,579 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2022-12-06 01:41:33,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:41:33,757 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:41:33,768 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2022-12-06 01:41:33,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:41:33,819 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:41:33,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33 WrapperNode [2022-12-06 01:41:33,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:41:33,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:41:33,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:41:33,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:41:33,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,884 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2022-12-06 01:41:33,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:41:33,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:41:33,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:41:33,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:41:33,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:41:33,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:41:33,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:41:33,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:41:33,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (1/1) ... [2022-12-06 01:41:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:41:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:41:33,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:41:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:41:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-12-06 01:41:33,981 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-12-06 01:41:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:41:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 01:41:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:41:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:41:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:41:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:41:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:41:33,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:41:33,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:41:33,986 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:41:34,132 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:41:34,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:41:34,389 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:41:34,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:41:34,396 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 01:41:34,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:41:34 BoogieIcfgContainer [2022-12-06 01:41:34,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:41:34,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:41:34,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:41:34,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:41:34,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:41:33" (1/3) ... [2022-12-06 01:41:34,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684f15fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:41:34, skipping insertion in model container [2022-12-06 01:41:34,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:41:33" (2/3) ... [2022-12-06 01:41:34,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684f15fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:41:34, skipping insertion in model container [2022-12-06 01:41:34,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:41:34" (3/3) ... [2022-12-06 01:41:34,407 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2022-12-06 01:41:34,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:41:34,423 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:41:34,423 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:41:34,507 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:41:34,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions, 261 flow [2022-12-06 01:41:34,615 INFO L130 PetriNetUnfolder]: 10/127 cut-off events. [2022-12-06 01:41:34,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:41:34,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-06 01:41:34,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 128 transitions, 261 flow [2022-12-06 01:41:34,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 127 transitions, 257 flow [2022-12-06 01:41:34,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:34,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 127 transitions, 257 flow [2022-12-06 01:41:34,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 127 transitions, 257 flow [2022-12-06 01:41:34,685 INFO L130 PetriNetUnfolder]: 10/127 cut-off events. [2022-12-06 01:41:34,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:41:34,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-06 01:41:34,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 127 transitions, 257 flow [2022-12-06 01:41:34,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 3920 [2022-12-06 01:41:39,140 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 01:41:39,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:41:39,157 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;@4c5c388e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:41:39,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 01:41:39,162 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 01:41:39,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:41:39,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:39,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 01:41:39,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1915721193, now seen corresponding path program 1 times [2022-12-06 01:41:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:39,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183985287] [2022-12-06 01:41:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:39,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183985287] [2022-12-06 01:41:39,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183985287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:39,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:41:39,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:41:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134009772] [2022-12-06 01:41:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:39,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:41:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:41:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:41:39,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 01:41:39,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:39,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:39,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 01:41:39,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:39,969 INFO L130 PetriNetUnfolder]: 216/379 cut-off events. [2022-12-06 01:41:39,969 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:41:39,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 379 events. 216/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1355 event pairs, 7 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 753. Up to 224 conditions per place. [2022-12-06 01:41:39,973 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 48 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2022-12-06 01:41:39,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 54 transitions, 217 flow [2022-12-06 01:41:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:41:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:41:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 01:41:39,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-06 01:41:39,985 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2022-12-06 01:41:39,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:39,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 54 transitions, 217 flow [2022-12-06 01:41:39,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 54 transitions, 217 flow [2022-12-06 01:41:39,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 01:41:40,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:41:40,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 01:41:40,025 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 54 transitions, 217 flow [2022-12-06 01:41:40,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:40,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:40,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:41:40,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash -742185088, now seen corresponding path program 1 times [2022-12-06 01:41:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:40,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913919514] [2022-12-06 01:41:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:40,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:40,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:40,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913919514] [2022-12-06 01:41:40,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913919514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:40,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:41:40,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:41:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111769030] [2022-12-06 01:41:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:40,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:41:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:41:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:41:40,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 01:41:40,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 54 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:40,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 01:41:40,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:40,263 INFO L130 PetriNetUnfolder]: 327/538 cut-off events. [2022-12-06 01:41:40,264 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 01:41:40,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 538 events. 327/538 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1970 event pairs, 21 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 1606. Up to 356 conditions per place. [2022-12-06 01:41:40,272 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 104 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2022-12-06 01:41:40,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 127 transitions, 761 flow [2022-12-06 01:41:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:41:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:41:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 01:41:40,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 01:41:40,280 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2022-12-06 01:41:40,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:40,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 127 transitions, 761 flow [2022-12-06 01:41:40,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 127 transitions, 761 flow [2022-12-06 01:41:40,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 01:41:40,287 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:41:40,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:41:40,289 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 127 transitions, 761 flow [2022-12-06 01:41:40,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:40,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:41:40,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1462653279, now seen corresponding path program 1 times [2022-12-06 01:41:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:40,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457040805] [2022-12-06 01:41:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:40,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:40,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457040805] [2022-12-06 01:41:40,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457040805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:40,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:41:40,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:41:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378244149] [2022-12-06 01:41:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:40,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:41:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:41:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:41:40,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 01:41:40,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 127 transitions, 761 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:40,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 01:41:40,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:40,648 INFO L130 PetriNetUnfolder]: 419/689 cut-off events. [2022-12-06 01:41:40,648 INFO L131 PetriNetUnfolder]: For 37/41 co-relation queries the response was YES. [2022-12-06 01:41:40,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 689 events. 419/689 cut-off events. For 37/41 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2590 event pairs, 12 based on Foata normal form. 16/444 useless extension candidates. Maximal degree in co-relation 2702. Up to 457 conditions per place. [2022-12-06 01:41:40,654 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 147 selfloop transitions, 32 changer transitions 0/184 dead transitions. [2022-12-06 01:41:40,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 184 transitions, 1461 flow [2022-12-06 01:41:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:41:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:41:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 01:41:40,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 01:41:40,657 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2022-12-06 01:41:40,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:40,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 184 transitions, 1461 flow [2022-12-06 01:41:40,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 184 transitions, 1461 flow [2022-12-06 01:41:40,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 01:41:40,665 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:41:40,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:41:40,666 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 184 transitions, 1461 flow [2022-12-06 01:41:40,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:40,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:41:40,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash -373808135, now seen corresponding path program 2 times [2022-12-06 01:41:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704431555] [2022-12-06 01:41:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704431555] [2022-12-06 01:41:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704431555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:40,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:41:40,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:41:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002174399] [2022-12-06 01:41:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:40,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:41:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:40,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:41:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:41:40,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 01:41:40,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 184 transitions, 1461 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:40,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 01:41:40,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:40,943 INFO L130 PetriNetUnfolder]: 103/218 cut-off events. [2022-12-06 01:41:40,944 INFO L131 PetriNetUnfolder]: For 19/25 co-relation queries the response was YES. [2022-12-06 01:41:40,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 218 events. 103/218 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 760 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 1053. Up to 178 conditions per place. [2022-12-06 01:41:40,945 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 78 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2022-12-06 01:41:40,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 92 transitions, 899 flow [2022-12-06 01:41:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:41:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:41:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 01:41:40,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-06 01:41:40,947 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2022-12-06 01:41:40,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:40,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 92 transitions, 899 flow [2022-12-06 01:41:40,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 92 transitions, 899 flow [2022-12-06 01:41:40,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 01:41:40,951 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:41:40,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:41:40,952 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 92 transitions, 899 flow [2022-12-06 01:41:40,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:40,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:40,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:40,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:41:40,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:40,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash 931762495, now seen corresponding path program 1 times [2022-12-06 01:41:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:40,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080639271] [2022-12-06 01:41:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:41,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:41,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080639271] [2022-12-06 01:41:41,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080639271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:41,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:41:41,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:41:41,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140743924] [2022-12-06 01:41:41,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:41,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:41:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:41:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:41:41,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 01:41:41,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 92 transitions, 899 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-06 01:41:41,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:41,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 01:41:41,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:41,506 INFO L130 PetriNetUnfolder]: 125/279 cut-off events. [2022-12-06 01:41:41,506 INFO L131 PetriNetUnfolder]: For 29/37 co-relation queries the response was YES. [2022-12-06 01:41:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 279 events. 125/279 cut-off events. For 29/37 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1067 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 1625. Up to 223 conditions per place. [2022-12-06 01:41:41,508 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 113 selfloop transitions, 25 changer transitions 0/139 dead transitions. [2022-12-06 01:41:41,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 139 transitions, 1631 flow [2022-12-06 01:41:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:41:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:41:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-06 01:41:41,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-06 01:41:41,510 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 18 predicate places. [2022-12-06 01:41:41,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:41,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 139 transitions, 1631 flow [2022-12-06 01:41:41,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 139 transitions, 1631 flow [2022-12-06 01:41:41,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 01:41:41,553 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:41:41,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 01:41:41,554 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 139 transitions, 1631 flow [2022-12-06 01:41:41,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-06 01:41:41,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:41,554 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:41,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:41:41,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1530985399, now seen corresponding path program 1 times [2022-12-06 01:41:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:41,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607085288] [2022-12-06 01:41:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:41,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607085288] [2022-12-06 01:41:41,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607085288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:41,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:41:41,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:41:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844066041] [2022-12-06 01:41:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:41:41,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:41:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:41:41,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 01:41:41,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 139 transitions, 1631 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:41,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:41,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 01:41:41,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:41,932 INFO L130 PetriNetUnfolder]: 84/200 cut-off events. [2022-12-06 01:41:41,932 INFO L131 PetriNetUnfolder]: For 38/48 co-relation queries the response was YES. [2022-12-06 01:41:41,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 200 events. 84/200 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 665 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 1351. Up to 160 conditions per place. [2022-12-06 01:41:41,934 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 77 selfloop transitions, 2 changer transitions 24/104 dead transitions. [2022-12-06 01:41:41,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 104 transitions, 1421 flow [2022-12-06 01:41:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:41:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:41:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 01:41:41,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.336 [2022-12-06 01:41:41,937 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2022-12-06 01:41:41,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:41,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 104 transitions, 1421 flow [2022-12-06 01:41:41,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 104 transitions, 1421 flow [2022-12-06 01:41:41,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 01:41:41,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:41:41,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 01:41:41,954 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 103 transitions, 1409 flow [2022-12-06 01:41:41,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:41,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:41,955 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:41:41,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:41,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1176923674, now seen corresponding path program 1 times [2022-12-06 01:41:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:41,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152424401] [2022-12-06 01:41:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:42,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152424401] [2022-12-06 01:41:42,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152424401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:41:42,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353855743] [2022-12-06 01:41:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:42,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:41:42,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:41:42,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 01:41:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 01:41:42,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:41:42,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 01:41:42,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:41:42,756 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 14 treesize of output 16 [2022-12-06 01:41:42,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-06 01:41:42,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-06 01:41:43,019 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 15 treesize of output 7 [2022-12-06 01:41:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:43,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 01:41:43,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353855743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:41:43,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 01:41:43,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2022-12-06 01:41:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608777845] [2022-12-06 01:41:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:41:43,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 01:41:43,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 01:41:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-06 01:41:43,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 01:41:43,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 103 transitions, 1409 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:43,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:43,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 01:41:43,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:43,357 INFO L130 PetriNetUnfolder]: 100/251 cut-off events. [2022-12-06 01:41:43,357 INFO L131 PetriNetUnfolder]: For 51/63 co-relation queries the response was YES. [2022-12-06 01:41:43,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1978 conditions, 251 events. 100/251 cut-off events. For 51/63 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 929 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 1951. Up to 212 conditions per place. [2022-12-06 01:41:43,359 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 87 selfloop transitions, 21 changer transitions 24/133 dead transitions. [2022-12-06 01:41:43,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 133 transitions, 2087 flow [2022-12-06 01:41:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:41:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:41:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-12-06 01:41:43,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-06 01:41:43,363 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 30 predicate places. [2022-12-06 01:41:43,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:43,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 133 transitions, 2087 flow [2022-12-06 01:41:43,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 133 transitions, 2087 flow [2022-12-06 01:41:43,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 01:41:43,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:41:43,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:41:43,380 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 132 transitions, 2073 flow [2022-12-06 01:41:43,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:43,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:43,380 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:43,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 01:41:43,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:43,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:43,586 INFO L85 PathProgramCache]: Analyzing trace with hash 771834570, now seen corresponding path program 1 times [2022-12-06 01:41:43,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:43,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237644988] [2022-12-06 01:41:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:44,484 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-06 01:41:44,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:44,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237644988] [2022-12-06 01:41:44,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237644988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:41:44,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400630592] [2022-12-06 01:41:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:44,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:44,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:41:44,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:41:44,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 01:41:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:44,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 01:41:44,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:41:44,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 01:41:44,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 01:41:44,620 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 14 treesize of output 16 [2022-12-06 01:41:44,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-12-06 01:41:44,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-12-06 01:41:44,909 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-06 01:41:44,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:41:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:45,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400630592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:41:45,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:41:45,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 10] total 30 [2022-12-06 01:41:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368098778] [2022-12-06 01:41:45,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:41:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 01:41:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 01:41:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2022-12-06 01:41:45,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 01:41:45,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 132 transitions, 2073 flow. Second operand has 32 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:45,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:45,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 01:41:45,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:47,573 INFO L130 PetriNetUnfolder]: 275/679 cut-off events. [2022-12-06 01:41:47,573 INFO L131 PetriNetUnfolder]: For 76/90 co-relation queries the response was YES. [2022-12-06 01:41:47,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 679 events. 275/679 cut-off events. For 76/90 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3143 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 5997. Up to 640 conditions per place. [2022-12-06 01:41:47,577 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 170 selfloop transitions, 60 changer transitions 136/367 dead transitions. [2022-12-06 01:41:47,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 367 transitions, 6521 flow [2022-12-06 01:41:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 01:41:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 01:41:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 288 transitions. [2022-12-06 01:41:47,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 01:41:47,582 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 68 predicate places. [2022-12-06 01:41:47,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:47,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 367 transitions, 6521 flow [2022-12-06 01:41:47,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 367 transitions, 6521 flow [2022-12-06 01:41:47,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 01:41:47,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L749-6-->L713: Formula: (and (= |v_ULTIMATE.start_pqueue_put_#in~qp#1.base_7| |v_~#pqb~0.base_58|) (= |v_~#pqb~0.offset_58| |v_ULTIMATE.start_pqueue_put_#in~qp#1.offset_7|) (< |v_ULTIMATE.start_main_~i~0#1_43| |v_ULTIMATE.start_main_~argc#1_33|) (= |v_ULTIMATE.start_pqueue_put_~qp#1.offset_88| |v_ULTIMATE.start_pqueue_put_#in~qp#1.offset_7|) (= |v_ULTIMATE.start_pqueue_put_#in~qp#1.base_7| |v_ULTIMATE.start_pqueue_put_~qp#1.base_88|)) InVars {ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_33|, ~#pqb~0.offset=|v_~#pqb~0.offset_58|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_43|, ~#pqb~0.base=|v_~#pqb~0.base_58|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_33|, ULTIMATE.start_pqueue_put_#t~mem3#1=|v_ULTIMATE.start_pqueue_put_#t~mem3#1_59|, ULTIMATE.start_pqueue_put_#t~post4#1=|v_ULTIMATE.start_pqueue_put_#t~post4#1_43|, ULTIMATE.start_pqueue_put_#in~qp#1.offset=|v_ULTIMATE.start_pqueue_put_#in~qp#1.offset_7|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_88|, ULTIMATE.start_pqueue_put_#t~nondet1#1=|v_ULTIMATE.start_pqueue_put_#t~nondet1#1_26|, ~#pqb~0.offset=|v_~#pqb~0.offset_58|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_43|, ~#pqb~0.base=|v_~#pqb~0.base_58|, ULTIMATE.start_pqueue_put_#t~mem2#1=|v_ULTIMATE.start_pqueue_put_#t~mem2#1_35|, ULTIMATE.start_pqueue_put_#res#1=|v_ULTIMATE.start_pqueue_put_#res#1_18|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_88|, ULTIMATE.start_pqueue_put_#in~qp#1.base=|v_ULTIMATE.start_pqueue_put_#in~qp#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_pqueue_put_#t~nondet1#1, ULTIMATE.start_pqueue_put_#t~mem3#1, ULTIMATE.start_pqueue_put_#t~mem2#1, ULTIMATE.start_pqueue_put_#res#1, ULTIMATE.start_pqueue_put_#t~post4#1, ULTIMATE.start_pqueue_put_#in~qp#1.offset, ULTIMATE.start_pqueue_put_~qp#1.base, ULTIMATE.start_pqueue_put_#in~qp#1.base, ULTIMATE.start_pqueue_put_~qp#1.offset] and [317] L723-5-->L723-1: Formula: (= |v_workerThread1of1ForFork0_pqueue_get_#t~mem6#1_3| (select (select |v_#memory_int_22| |v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_7|) |v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_7|)) InVars {#memory_int=|v_#memory_int_22|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_7|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_7|} OutVars{#memory_int=|v_#memory_int_22|, workerThread1of1ForFork0_pqueue_get_~qp#1.base=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.base_7|, workerThread1of1ForFork0_pqueue_get_#t~mem6#1=|v_workerThread1of1ForFork0_pqueue_get_#t~mem6#1_3|, workerThread1of1ForFork0_pqueue_get_~qp#1.offset=|v_workerThread1of1ForFork0_pqueue_get_~qp#1.offset_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_pqueue_get_#t~mem6#1] [2022-12-06 01:41:47,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:41:47,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 01:41:47,679 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 366 transitions, 6507 flow [2022-12-06 01:41:47,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.5) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:47,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:47,680 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:47,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 01:41:47,885 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,SelfDestructingSolverStorable7 [2022-12-06 01:41:47,886 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash 632695125, now seen corresponding path program 1 times [2022-12-06 01:41:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:47,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820503489] [2022-12-06 01:41:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:48,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:48,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820503489] [2022-12-06 01:41:48,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820503489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:41:48,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221065218] [2022-12-06 01:41:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:48,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:48,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:41:48,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:41:48,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 01:41:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:48,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 01:41:48,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:41:49,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-06 01:41:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 01:41:49,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:41:49,443 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:41:49,443 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 71 treesize of output 55 [2022-12-06 01:41:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 01:41:49,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221065218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:41:49,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:41:49,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2022-12-06 01:41:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864326757] [2022-12-06 01:41:49,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:41:49,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 01:41:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 01:41:49,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-12-06 01:41:49,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 01:41:49,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 366 transitions, 6507 flow. Second operand has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:49,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:49,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 01:41:49,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:51,177 INFO L130 PetriNetUnfolder]: 388/988 cut-off events. [2022-12-06 01:41:51,177 INFO L131 PetriNetUnfolder]: For 102/118 co-relation queries the response was YES. [2022-12-06 01:41:51,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9748 conditions, 988 events. 388/988 cut-off events. For 102/118 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5181 event pairs, 0 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 9715. Up to 949 conditions per place. [2022-12-06 01:41:51,182 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 170 selfloop transitions, 117 changer transitions 246/534 dead transitions. [2022-12-06 01:41:51,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 534 transitions, 10557 flow [2022-12-06 01:41:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 01:41:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 01:41:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 180 transitions. [2022-12-06 01:41:51,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21634615384615385 [2022-12-06 01:41:51,186 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 93 predicate places. [2022-12-06 01:41:51,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:51,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 534 transitions, 10557 flow [2022-12-06 01:41:51,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 534 transitions, 10557 flow [2022-12-06 01:41:51,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 01:41:51,233 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:41:51,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 01:41:51,234 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 531 transitions, 10503 flow [2022-12-06 01:41:51,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:51,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:41:51,234 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:51,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 01:41:51,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:51,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-06 01:41:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:41:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1066117249, now seen corresponding path program 2 times [2022-12-06 01:41:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:41:51,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061445461] [2022-12-06 01:41:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:41:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:41:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:41:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:41:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061445461] [2022-12-06 01:41:51,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061445461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 01:41:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823596637] [2022-12-06 01:41:51,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 01:41:51,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:51,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:41:51,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 01:41:51,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 01:41:51,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 01:41:51,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 01:41:51,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 01:41:51,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 01:41:52,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-06 01:41:52,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-06 01:41:52,202 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 15 treesize of output 7 [2022-12-06 01:41:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:52,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 01:41:52,457 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-06 01:41:52,457 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 48 treesize of output 36 [2022-12-06 01:41:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:41:52,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823596637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 01:41:52,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 01:41:52,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-12-06 01:41:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878816721] [2022-12-06 01:41:52,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 01:41:52,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 01:41:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:41:52,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 01:41:52,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2022-12-06 01:41:52,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 01:41:52,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 531 transitions, 10503 flow. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:52,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:41:52,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 01:41:52,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:41:53,292 INFO L130 PetriNetUnfolder]: 400/1033 cut-off events. [2022-12-06 01:41:53,293 INFO L131 PetriNetUnfolder]: For 122/140 co-relation queries the response was YES. [2022-12-06 01:41:53,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11222 conditions, 1033 events. 400/1033 cut-off events. For 122/140 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5689 event pairs, 0 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 11186. Up to 994 conditions per place. [2022-12-06 01:41:53,298 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 0 selfloop transitions, 0 changer transitions 567/567 dead transitions. [2022-12-06 01:41:53,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 567 transitions, 12343 flow [2022-12-06 01:41:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 01:41:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 01:41:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2022-12-06 01:41:53,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19950738916256158 [2022-12-06 01:41:53,299 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, 97 predicate places. [2022-12-06 01:41:53,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:41:53,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 567 transitions, 12343 flow [2022-12-06 01:41:53,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 567 transitions, 12343 flow [2022-12-06 01:41:53,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 01:41:53,317 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:41:53,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 01:41:53,318 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 567 transitions, 12343 flow [2022-12-06 01:41:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 35 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:41:53,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-12-06 01:41:53,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 01:41:53,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-06 01:41:53,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-06 01:41:53,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 01:41:53,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 01:41:53,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 01:41:53,533 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-06 01:41:53,537 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:41:53,537 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:41:53,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:41:53 BasicIcfg [2022-12-06 01:41:53,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:41:53,541 INFO L158 Benchmark]: Toolchain (without parser) took 20126.76ms. Allocated memory was 191.9MB in the beginning and 433.1MB in the end (delta: 241.2MB). Free memory was 166.8MB in the beginning and 200.8MB in the end (delta: -33.9MB). Peak memory consumption was 208.5MB. Max. memory is 8.0GB. [2022-12-06 01:41:53,542 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory was 168.5MB in the beginning and 168.4MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:41:53,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.67ms. Allocated memory is still 191.9MB. Free memory was 166.8MB in the beginning and 147.0MB in the end (delta: 19.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 01:41:53,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.42ms. Allocated memory is still 191.9MB. Free memory was 147.0MB in the beginning and 145.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:41:53,542 INFO L158 Benchmark]: Boogie Preprocessor took 29.44ms. Allocated memory is still 191.9MB. Free memory was 145.0MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:41:53,542 INFO L158 Benchmark]: RCFGBuilder took 480.01ms. Allocated memory is still 191.9MB. Free memory was 143.0MB in the beginning and 127.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 01:41:53,543 INFO L158 Benchmark]: TraceAbstraction took 19141.16ms. Allocated memory was 191.9MB in the beginning and 433.1MB in the end (delta: 241.2MB). Free memory was 126.7MB in the beginning and 200.8MB in the end (delta: -74.0MB). Peak memory consumption was 168.7MB. Max. memory is 8.0GB. [2022-12-06 01:41:53,546 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.13ms. Allocated memory is still 191.9MB. Free memory was 168.5MB in the beginning and 168.4MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.67ms. Allocated memory is still 191.9MB. Free memory was 166.8MB in the beginning and 147.0MB in the end (delta: 19.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.42ms. Allocated memory is still 191.9MB. Free memory was 147.0MB in the beginning and 145.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.44ms. Allocated memory is still 191.9MB. Free memory was 145.0MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 480.01ms. Allocated memory is still 191.9MB. Free memory was 143.0MB in the beginning and 127.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19141.16ms. Allocated memory was 191.9MB in the beginning and 433.1MB in the end (delta: 241.2MB). Free memory was 126.7MB in the beginning and 200.8MB in the end (delta: -74.0MB). Peak memory consumption was 168.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 121 PlacesBefore, 24 PlacesAfterwards, 127 TransitionsBefore, 26 TransitionsAfterwards, 3920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 65 ConcurrentYvCompositions, 4 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 2505, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2563, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2274, independent: 2239, independent conditional: 0, independent unconditional: 2239, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2274, independent: 2237, independent conditional: 0, independent unconditional: 2237, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2563, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 2274, unknown conditional: 0, unknown unconditional: 2274] , Statistics on independence cache: Total cache size (in pairs): 4035, Positive cache size: 4000, Positive conditional cache size: 0, Positive unconditional cache size: 4000, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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, 26 PlacesBefore, 26 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 38 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, 33 PlacesBefore, 33 PlacesAfterwards, 184 TransitionsBefore, 184 TransitionsAfterwards, 38 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, 35 PlacesBefore, 35 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 38 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, 42 PlacesBefore, 42 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 44 PlacesAfterwards, 104 TransitionsBefore, 103 TransitionsAfterwards, 48 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, 54 PlacesBefore, 53 PlacesAfterwards, 133 TransitionsBefore, 132 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 92 PlacesBefore, 91 PlacesAfterwards, 367 TransitionsBefore, 366 TransitionsAfterwards, 46 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, 117 PlacesBefore, 114 PlacesAfterwards, 534 TransitionsBefore, 531 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 121 PlacesBefore, 121 PlacesAfterwards, 567 TransitionsBefore, 567 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 170 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 941 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4771 IncrementalHoareTripleChecker+Invalid, 4953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 4 mSDtfsCounter, 4771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12343occurred in iteration=10, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 258 ConstructedInterpolants, 11 QuantifiedInterpolants, 3604 SizeOfPredicates, 69 NumberOfNonLiveVariables, 879 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 36/62 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:41:53,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...