/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:41:08,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:41:08,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:41:08,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:41:08,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:41:08,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:41:08,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:41:08,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:41:08,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:41:08,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:41:08,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:41:08,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:41:08,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:41:08,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:41:08,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:41:08,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:41:08,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:41:08,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:41:08,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:41:08,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:41:08,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:41:08,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:41:08,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:41:08,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:41:08,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:41:08,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:41:08,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:41:08,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:41:08,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:41:08,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:41:08,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:41:08,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:41:08,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:41:08,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:41:08,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:41:08,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:41:08,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:41:08,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:41:08,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:41:08,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:41:08,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:41:08,402 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-05 23:41:08,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:41:08,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:41:08,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:41:08,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:41:08,429 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:41:08,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:41:08,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:41:08,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:41:08,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:41:08,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:41:08,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:41:08,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:41:08,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:41:08,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:41:08,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:41:08,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:41:08,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:41:08,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:41:08,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:41:08,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:41:08,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:41:08,432 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 [2022-12-05 23:41:08,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:41:08,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:41:08,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:41:08,706 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:41:08,706 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:41:08,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.i [2022-12-05 23:41:09,606 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:41:09,840 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:41:09,840 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.i [2022-12-05 23:41:09,856 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7cf7489/80c96531c0274a6a8e355981408a78da/FLAG652291898 [2022-12-05 23:41:09,868 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7cf7489/80c96531c0274a6a8e355981408a78da [2022-12-05 23:41:09,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:41:09,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:41:09,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:41:09,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:41:09,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:41:09,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:41:09" (1/1) ... [2022-12-05 23:41:09,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8108bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:09, skipping insertion in model container [2022-12-05 23:41:09,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:41:09" (1/1) ... [2022-12-05 23:41:09,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:41:09,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:41:10,020 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_01-priv_nr_true.i[1084,1097] [2022-12-05 23:41:10,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:41:10,148 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:41:10,157 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_01-priv_nr_true.i[1084,1097] [2022-12-05 23:41:10,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:41:10,232 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:41:10,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10 WrapperNode [2022-12-05 23:41:10,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:41:10,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:41:10,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:41:10,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:41:10,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,270 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2022-12-05 23:41:10,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:41:10,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:41:10,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:41:10,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:41:10,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:41:10,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:41:10,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:41:10,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:41:10,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (1/1) ... [2022-12-05 23:41:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:41:10,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:41:10,314 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-05 23:41:10,319 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-05 23:41:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:41:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:41:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:41:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:41:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:41:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:41:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:41:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:41:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:41:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:41:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:41:10,341 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:41:10,432 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:41:10,433 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:41:10,557 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:41:10,562 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:41:10,562 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:41:10,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:41:10 BoogieIcfgContainer [2022-12-05 23:41:10,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:41:10,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:41:10,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:41:10,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:41:10,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:41:09" (1/3) ... [2022-12-05 23:41:10,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c92a73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:41:10, skipping insertion in model container [2022-12-05 23:41:10,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:41:10" (2/3) ... [2022-12-05 23:41:10,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c92a73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:41:10, skipping insertion in model container [2022-12-05 23:41:10,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:41:10" (3/3) ... [2022-12-05 23:41:10,569 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_01-priv_nr_true.i [2022-12-05 23:41:10,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:41:10,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-05 23:41:10,582 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:41:10,630 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-05 23:41:10,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 194 flow [2022-12-05 23:41:10,715 INFO L130 PetriNetUnfolder]: 4/92 cut-off events. [2022-12-05 23:41:10,715 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:41:10,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 92 events. 4/92 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 23:41:10,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 194 flow [2022-12-05 23:41:10,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 85 transitions, 173 flow [2022-12-05 23:41:10,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:10,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 85 transitions, 173 flow [2022-12-05 23:41:10,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 85 transitions, 173 flow [2022-12-05 23:41:10,779 INFO L130 PetriNetUnfolder]: 4/85 cut-off events. [2022-12-05 23:41:10,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:10,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 85 events. 4/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-05 23:41:10,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 85 transitions, 173 flow [2022-12-05 23:41:10,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-05 23:41:13,799 INFO L203 LiptonReduction]: Total number of compositions: 73 [2022-12-05 23:41:13,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:41:13,812 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;@127be2c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:41:13,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:41:13,813 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:41:13,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:13,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:41:13,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 23:41:13,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:41:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:41:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 345, now seen corresponding path program 1 times [2022-12-05 23:41:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:41:13,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479746641] [2022-12-05 23:41:13,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:41:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:41:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:41:13,884 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-05 23:41:13,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:41:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479746641] [2022-12-05 23:41:13,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479746641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:41:13,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:41:13,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 23:41:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346310381] [2022-12-05 23:41:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:41:13,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:41:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:41:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:41:13,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:41:13,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 23:41:13,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 57 flow. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-05 23:41:13,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:41:13,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 23:41:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:41:13,938 INFO L130 PetriNetUnfolder]: 72/172 cut-off events. [2022-12-05 23:41:13,939 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 172 events. 72/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 592 event pairs, 72 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 331. Up to 164 conditions per place. [2022-12-05 23:41:13,940 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 19 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-05 23:41:13,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 81 flow [2022-12-05 23:41:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:41:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:41:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2022-12-05 23:41:13,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-05 23:41:13,949 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 57 flow. Second operand 2 states and 28 transitions. [2022-12-05 23:41:13,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 81 flow [2022-12-05 23:41:13,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:41:13,951 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 42 flow [2022-12-05 23:41:13,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2022-12-05 23:41:13,954 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2022-12-05 23:41:13,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:41:13,955 INFO L89 Accepts]: Start accepts. Operand has 24 places, 20 transitions, 42 flow [2022-12-05 23:41:13,956 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:41:13,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:13,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 20 transitions, 42 flow [2022-12-05 23:41:13,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 42 flow [2022-12-05 23:41:13,960 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-05 23:41:13,960 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:41:13,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 20 transitions, 42 flow [2022-12-05 23:41:13,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-05 23:41:14,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:41:14,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:41:14,013 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 42 flow [2022-12-05 23:41:14,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-05 23:41:14,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:41:14,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:41:14,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:41:14,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:41:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:41:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 10839787, now seen corresponding path program 1 times [2022-12-05 23:41:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:41:14,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248470710] [2022-12-05 23:41:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:41:14,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:41:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:41:14,219 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-05 23:41:14,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:41:14,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248470710] [2022-12-05 23:41:14,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248470710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:41:14,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:41:14,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:41:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544560090] [2022-12-05 23:41:14,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:41:14,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:41:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:41:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:41:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:41:14,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:41:14,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-05 23:41:14,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:41:14,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:41:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:41:14,255 INFO L130 PetriNetUnfolder]: 77/174 cut-off events. [2022-12-05 23:41:14,255 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:14,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 174 events. 77/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 583 event pairs, 38 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 344. Up to 149 conditions per place. [2022-12-05 23:41:14,256 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 25 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-12-05 23:41:14,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 114 flow [2022-12-05 23:41:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:41:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:41:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 23:41:14,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-05 23:41:14,258 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 42 flow. Second operand 3 states and 29 transitions. [2022-12-05 23:41:14,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 114 flow [2022-12-05 23:41:14,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:41:14,259 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 61 flow [2022-12-05 23:41:14,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2022-12-05 23:41:14,259 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-05 23:41:14,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:41:14,259 INFO L89 Accepts]: Start accepts. Operand has 26 places, 22 transitions, 61 flow [2022-12-05 23:41:14,260 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:41:14,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:14,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 22 transitions, 61 flow [2022-12-05 23:41:14,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 61 flow [2022-12-05 23:41:14,263 INFO L130 PetriNetUnfolder]: 1/27 cut-off events. [2022-12-05 23:41:14,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:14,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 1/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 49 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-05 23:41:14,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 61 flow [2022-12-05 23:41:14,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-05 23:41:14,267 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:41:14,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:41:14,268 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 61 flow [2022-12-05 23:41:14,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-05 23:41:14,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:41:14,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:41:14,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:41:14,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:41:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:41:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1827085363, now seen corresponding path program 1 times [2022-12-05 23:41:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:41:14,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619760794] [2022-12-05 23:41:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:41:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:41:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:41:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:41:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:41:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619760794] [2022-12-05 23:41:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619760794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:41:14,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:41:14,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:41:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30121000] [2022-12-05 23:41:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:41:14,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:41:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:41:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:41:14,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:41:14,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:41:14,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 61 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 23:41:14,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:41:14,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:41:14,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:41:14,413 INFO L130 PetriNetUnfolder]: 83/188 cut-off events. [2022-12-05 23:41:14,413 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:41:14,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 188 events. 83/188 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 686 event pairs, 49 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 404. Up to 155 conditions per place. [2022-12-05 23:41:14,414 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 25 selfloop transitions, 5 changer transitions 3/33 dead transitions. [2022-12-05 23:41:14,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 151 flow [2022-12-05 23:41:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:41:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:41:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-05 23:41:14,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 23:41:14,418 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 61 flow. Second operand 3 states and 32 transitions. [2022-12-05 23:41:14,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 151 flow [2022-12-05 23:41:14,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:41:14,419 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 87 flow [2022-12-05 23:41:14,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2022-12-05 23:41:14,421 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2022-12-05 23:41:14,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:41:14,421 INFO L89 Accepts]: Start accepts. Operand has 28 places, 24 transitions, 87 flow [2022-12-05 23:41:14,421 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:41:14,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:14,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 87 flow [2022-12-05 23:41:14,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 87 flow [2022-12-05 23:41:14,426 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-05 23:41:14,426 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-05 23:41:14,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 42 events. 6/42 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 69. Up to 15 conditions per place. [2022-12-05 23:41:14,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 87 flow [2022-12-05 23:41:14,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:41:14,431 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:41:14,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:41:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 87 flow [2022-12-05 23:41:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-05 23:41:14,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:41:14,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:41:14,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:41:14,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:41:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:41:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1826144459, now seen corresponding path program 1 times [2022-12-05 23:41:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:41:14,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364971084] [2022-12-05 23:41:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:41:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:41:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:41:14,507 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-05 23:41:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:41:14,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364971084] [2022-12-05 23:41:14,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364971084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:41:14,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:41:14,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:41:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034639977] [2022-12-05 23:41:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:41:14,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:41:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:41:14,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:41:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:41:14,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:41:14,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 87 flow. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-05 23:41:14,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:41:14,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:41:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:41:14,586 INFO L130 PetriNetUnfolder]: 86/197 cut-off events. [2022-12-05 23:41:14,586 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-05 23:41:14,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 197 events. 86/197 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 758 event pairs, 27 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 492. Up to 126 conditions per place. [2022-12-05 23:41:14,591 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 31 selfloop transitions, 9 changer transitions 10/50 dead transitions. [2022-12-05 23:41:14,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 50 transitions, 269 flow [2022-12-05 23:41:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:41:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:41:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-05 23:41:14,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-05 23:41:14,599 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 87 flow. Second operand 6 states and 47 transitions. [2022-12-05 23:41:14,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 50 transitions, 269 flow [2022-12-05 23:41:14,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 50 transitions, 256 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:41:14,602 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 138 flow [2022-12-05 23:41:14,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-05 23:41:14,603 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2022-12-05 23:41:14,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:41:14,604 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 138 flow [2022-12-05 23:41:14,604 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:41:14,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:14,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 138 flow [2022-12-05 23:41:14,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 138 flow [2022-12-05 23:41:14,609 INFO L130 PetriNetUnfolder]: 9/50 cut-off events. [2022-12-05 23:41:14,609 INFO L131 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2022-12-05 23:41:14,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 50 events. 9/50 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 170 event pairs, 1 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 107. Up to 21 conditions per place. [2022-12-05 23:41:14,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 138 flow [2022-12-05 23:41:14,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:41:14,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [254] L699-1-->L700-1: Formula: (= v_~glob1~0_37 |v_ULTIMATE.start_main_#t~post5#1_27|) InVars {~glob1~0=v_~glob1~0_37} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_12|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_27|, ~glob1~0=v_~glob1~0_37} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~post5#1] and [269] L688-1-->L690: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_19| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_33|) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_33| 0)) (= (+ v_~glob1~0_67 10) 0)) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_19|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_19|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_33|, ~glob1~0=v_~glob1~0_67} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, ~glob1~0] [2022-12-05 23:41:14,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:41:14,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-05 23:41:14,649 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 137 flow [2022-12-05 23:41:14,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-05 23:41:14,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:41:14,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:41:14,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:41:14,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:41:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:41:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1827106622, now seen corresponding path program 1 times [2022-12-05 23:41:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:41:14,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550581016] [2022-12-05 23:41:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:41:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:41:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:41:14,698 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-05 23:41:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:41:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550581016] [2022-12-05 23:41:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550581016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:41:14,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:41:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:41:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774544748] [2022-12-05 23:41:14,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:41:14,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:41:14,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:41:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:41:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:41:14,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:41:14,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-05 23:41:14,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:41:14,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:41:14,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:41:14,720 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-05 23:41:14,721 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:41:14,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 25 events. 0/25 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 9/34 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2022-12-05 23:41:14,721 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 13 selfloop transitions, 4 changer transitions 1/19 dead transitions. [2022-12-05 23:41:14,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 19 transitions, 115 flow [2022-12-05 23:41:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:41:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:41:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-05 23:41:14,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-05 23:41:14,721 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 137 flow. Second operand 3 states and 22 transitions. [2022-12-05 23:41:14,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 19 transitions, 115 flow [2022-12-05 23:41:14,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 95 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-05 23:41:14,723 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 65 flow [2022-12-05 23:41:14,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:41:14,725 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2022-12-05 23:41:14,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:41:14,725 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 65 flow [2022-12-05 23:41:14,726 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:41:14,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:14,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 65 flow [2022-12-05 23:41:14,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 18 transitions, 65 flow [2022-12-05 23:41:14,729 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-05 23:41:14,729 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:41:14,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:41:14,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 18 transitions, 65 flow [2022-12-05 23:41:14,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:41:15,293 INFO L203 LiptonReduction]: Total number of compositions: 12 [2022-12-05 23:41:15,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 572 [2022-12-05 23:41:15,297 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 7 transitions, 48 flow [2022-12-05 23:41:15,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-05 23:41:15,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:41:15,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:41:15,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:41:15,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:41:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:41:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 10840675, now seen corresponding path program 1 times [2022-12-05 23:41:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:41:15,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811647502] [2022-12-05 23:41:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:41:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:41:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:41:15,364 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-05 23:41:15,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:41:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811647502] [2022-12-05 23:41:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811647502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:41:15,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:41:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:41:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137886051] [2022-12-05 23:41:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:41:15,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:41:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:41:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:41:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:41:15,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 7 [2022-12-05 23:41:15,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 7 transitions, 48 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-05 23:41:15,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:41:15,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 7 [2022-12-05 23:41:15,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:41:15,375 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-05 23:41:15,375 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:41:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 5 events. 0/5 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 3 event pairs, 0 based on Foata normal form. 2/6 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:41:15,375 INFO L137 encePairwiseOnDemand]: 3/7 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2022-12-05 23:41:15,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 5 transitions, 44 flow [2022-12-05 23:41:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:41:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:41:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-12-05 23:41:15,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 23:41:15,376 INFO L175 Difference]: Start difference. First operand has 17 places, 7 transitions, 48 flow. Second operand 3 states and 7 transitions. [2022-12-05 23:41:15,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 5 transitions, 44 flow [2022-12-05 23:41:15,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 5 transitions, 28 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-05 23:41:15,376 INFO L231 Difference]: Finished difference. Result has 13 places, 0 transitions, 0 flow [2022-12-05 23:41:15,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=7, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=13, PETRI_TRANSITIONS=0} [2022-12-05 23:41:15,381 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -15 predicate places. [2022-12-05 23:41:15,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:41:15,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 0 transitions, 0 flow [2022-12-05 23:41:15,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:41:15,383 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:41:15,383 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:41:15,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:41:15,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:41:15,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:41:15,383 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:41:15,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:41:15,384 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:41:15,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-05 23:41:15,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:41:15,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:41:15,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:41:15,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-12-05 23:41:15,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-05 23:41:15,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-05 23:41:15,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:41:15,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:41:15,386 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-05 23:41:15,396 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:41:15,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:41:15,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:41:15 BasicIcfg [2022-12-05 23:41:15,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:41:15,398 INFO L158 Benchmark]: Toolchain (without parser) took 5527.46ms. Allocated memory was 201.3MB in the beginning and 245.4MB in the end (delta: 44.0MB). Free memory was 177.4MB in the beginning and 91.8MB in the end (delta: 85.6MB). Peak memory consumption was 131.2MB. Max. memory is 8.0GB. [2022-12-05 23:41:15,398 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:41:15,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.41ms. Allocated memory is still 201.3MB. Free memory was 176.9MB in the beginning and 158.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:41:15,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.90ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:41:15,399 INFO L158 Benchmark]: Boogie Preprocessor took 16.65ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:41:15,399 INFO L158 Benchmark]: RCFGBuilder took 275.30ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 140.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 23:41:15,399 INFO L158 Benchmark]: TraceAbstraction took 4833.01ms. Allocated memory was 201.3MB in the beginning and 245.4MB in the end (delta: 44.0MB). Free memory was 139.7MB in the beginning and 91.8MB in the end (delta: 47.9MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. [2022-12-05 23:41:15,400 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 361.41ms. Allocated memory is still 201.3MB. Free memory was 176.9MB in the beginning and 158.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.90ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.65ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.30ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 140.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4833.01ms. Allocated memory was 201.3MB in the beginning and 245.4MB in the end (delta: 44.0MB). Free memory was 139.7MB in the beginning and 91.8MB in the end (delta: 47.9MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 85 PlacesBefore, 28 PlacesAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 27 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1535, independent: 1421, independent conditional: 1421, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1535, independent: 1421, independent conditional: 0, independent unconditional: 1421, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1535, independent: 1421, independent conditional: 0, independent unconditional: 1421, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1535, independent: 1421, independent conditional: 0, independent unconditional: 1421, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 881, independent: 846, independent conditional: 0, independent unconditional: 846, 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: 881, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1535, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 881, unknown conditional: 0, unknown unconditional: 881] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1833, Positive conditional cache size: 0, Positive unconditional cache size: 1833, 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, 23 PlacesBefore, 23 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 91, unknown conditional: 0, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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, 22 TransitionsBefore, 22 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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, 27 PlacesBefore, 27 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 29, Negative conditional cache size: 3, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 65, independent conditional: 8, independent unconditional: 57, dependent: 43, dependent conditional: 26, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 65, independent conditional: 4, independent unconditional: 61, dependent: 51, dependent conditional: 34, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 65, independent conditional: 4, independent unconditional: 61, dependent: 51, dependent conditional: 34, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 65, independent conditional: 4, independent unconditional: 61, dependent: 45, dependent conditional: 28, dependent unconditional: 17, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 35, Negative conditional cache size: 9, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 27 PlacesBefore, 17 PlacesAfterwards, 18 TransitionsBefore, 7 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 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): 176, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 35, Negative conditional cache size: 9, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 35, Negative conditional cache size: 9, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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, 116 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 4 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:41:15,429 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...