/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:31:08,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:31:08,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:31:08,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:31:08,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:31:08,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:31:08,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:31:08,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:31:08,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:31:08,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:31:08,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:31:08,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:31:08,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:31:08,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:31:08,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:31:08,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:31:08,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:31:08,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:31:08,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:31:08,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:31:08,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:31:08,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:31:08,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:31:08,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:31:08,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:31:08,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:31:08,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:31:08,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:31:08,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:31:08,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:31:08,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:31:08,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:31:08,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:31:08,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:31:08,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:31:08,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:31:08,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:31:08,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:31:08,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:31:08,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:31:08,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:31:08,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 05:31:08,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:31:08,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:31:08,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:31:08,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:31:08,235 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:31:08,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:31:08,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:31:08,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:31:08,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:31:08,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:31:08,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:31:08,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:31:08,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:31:08,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:31:08,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:31:08,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:31:08,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:31:08,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:31:08,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:31:08,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:31:08,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 05:31:08,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:31:08,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:31:08,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:31:08,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:31:08,568 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:31:08,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-13 05:31:09,551 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:31:09,711 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:31:09,711 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-13 05:31:09,718 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea920a3e/32c980cac0244bfd9a1c95df6658ac80/FLAG83cac00a6 [2022-12-13 05:31:09,729 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea920a3e/32c980cac0244bfd9a1c95df6658ac80 [2022-12-13 05:31:09,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:31:09,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:31:09,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:31:09,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:31:09,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:31:09,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:09,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e57a934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09, skipping insertion in model container [2022-12-13 05:31:09,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:09,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:31:09,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:31:09,914 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2572,2585] [2022-12-13 05:31:09,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:31:09,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:31:09,966 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2572,2585] [2022-12-13 05:31:09,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:31:09,979 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:31:09,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09 WrapperNode [2022-12-13 05:31:09,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:31:09,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:31:09,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:31:09,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:31:09,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,032 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 154 [2022-12-13 05:31:10,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:31:10,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:31:10,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:31:10,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:31:10,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,065 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:31:10,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:31:10,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:31:10,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:31:10,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (1/1) ... [2022-12-13 05:31:10,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:31:10,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:10,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 05:31:10,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 05:31:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:31:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 05:31:10,180 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 05:31:10,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 05:31:10,180 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:31:10,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:31:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:31:10,182 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 05:31:10,305 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:31:10,306 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:31:10,545 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:31:10,551 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:31:10,551 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 05:31:10,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:31:10 BoogieIcfgContainer [2022-12-13 05:31:10,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:31:10,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:31:10,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:31:10,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:31:10,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:31:09" (1/3) ... [2022-12-13 05:31:10,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45113f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:31:10, skipping insertion in model container [2022-12-13 05:31:10,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:09" (2/3) ... [2022-12-13 05:31:10,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45113f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:31:10, skipping insertion in model container [2022-12-13 05:31:10,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:31:10" (3/3) ... [2022-12-13 05:31:10,579 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2022-12-13 05:31:10,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:31:10,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 05:31:10,594 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:31:10,710 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 05:31:10,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 180 transitions, 376 flow [2022-12-13 05:31:10,847 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-12-13 05:31:10,847 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:31:10,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 16/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 05:31:10,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 180 transitions, 376 flow [2022-12-13 05:31:10,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 170 transitions, 352 flow [2022-12-13 05:31:10,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:10,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-13 05:31:10,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 170 transitions, 352 flow [2022-12-13 05:31:10,930 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2022-12-13 05:31:10,930 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:31:10,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 16/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 05:31:10,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-13 05:31:10,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 3242 [2022-12-13 05:31:14,892 INFO L241 LiptonReduction]: Total number of compositions: 153 [2022-12-13 05:31:14,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:31:14,907 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;@5e848805, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:31:14,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 05:31:14,910 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 05:31:14,910 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:31:14,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:14,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:14,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -862149159, now seen corresponding path program 1 times [2022-12-13 05:31:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220999415] [2022-12-13 05:31:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:15,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:15,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220999415] [2022-12-13 05:31:15,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220999415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:15,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:31:15,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 05:31:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289895748] [2022-12-13 05:31:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:15,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:31:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:31:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:31:15,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 05:31:15,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:15,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:15,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 05:31:15,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:15,301 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 05:31:15,301 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 05:31:15,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 187 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-13 05:31:15,302 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 05:31:15,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 05:31:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:31:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:31:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 05:31:15,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 05:31:15,313 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 05:31:15,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 05:31:15,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 80 flow [2022-12-13 05:31:15,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:15,315 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 05:31:15,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:15,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:15,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 05:31:15,323 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 05:31:15,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 05:31:16,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:31:16,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 715 [2022-12-13 05:31:16,031 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 76 flow [2022-12-13 05:31:16,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:16,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:16,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:31:16,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -552535443, now seen corresponding path program 1 times [2022-12-13 05:31:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:16,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103607075] [2022-12-13 05:31:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:16,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103607075] [2022-12-13 05:31:16,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103607075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:16,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:31:16,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 05:31:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171432689] [2022-12-13 05:31:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:16,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:31:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:31:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:31:16,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 05:31:16,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:16,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 05:31:16,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:16,263 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 05:31:16,263 INFO L131 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-12-13 05:31:16,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 116 events. 66/116 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2022-12-13 05:31:16,267 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 05:31:16,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 175 flow [2022-12-13 05:31:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:31:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:31:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 05:31:16,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 05:31:16,269 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 05:31:16,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 27 transitions, 175 flow [2022-12-13 05:31:16,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 26 transitions, 166 flow [2022-12-13 05:31:16,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:16,274 INFO L89 Accepts]: Start accepts. Operand has 24 places, 26 transitions, 166 flow [2022-12-13 05:31:16,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:16,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:16,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 26 transitions, 166 flow [2022-12-13 05:31:16,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 26 transitions, 166 flow [2022-12-13 05:31:16,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 05:31:16,278 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:16,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 05:31:16,279 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 26 transitions, 166 flow [2022-12-13 05:31:16,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:16,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:16,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:31:16,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 949209500, now seen corresponding path program 1 times [2022-12-13 05:31:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:16,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559099162] [2022-12-13 05:31:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559099162] [2022-12-13 05:31:16,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559099162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:16,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:31:16,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:31:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346703596] [2022-12-13 05:31:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:16,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:31:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:31:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:31:16,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:31:16,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:16,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:31:16,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:16,556 INFO L130 PetriNetUnfolder]: 85/167 cut-off events. [2022-12-13 05:31:16,556 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 05:31:16,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 167 events. 85/167 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 546 event pairs, 8 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 518. Up to 142 conditions per place. [2022-12-13 05:31:16,558 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 36 selfloop transitions, 4 changer transitions 12/52 dead transitions. [2022-12-13 05:31:16,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 52 transitions, 433 flow [2022-12-13 05:31:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:31:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:31:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 05:31:16,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 05:31:16,560 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-13 05:31:16,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 52 transitions, 433 flow [2022-12-13 05:31:16,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 40 transitions, 332 flow [2022-12-13 05:31:16,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:16,562 INFO L89 Accepts]: Start accepts. Operand has 27 places, 40 transitions, 332 flow [2022-12-13 05:31:16,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:16,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:16,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 40 transitions, 332 flow [2022-12-13 05:31:16,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 40 transitions, 332 flow [2022-12-13 05:31:16,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:16,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:16,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:31:16,567 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 40 transitions, 332 flow [2022-12-13 05:31:16,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:16,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:16,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:31:16,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -268568836, now seen corresponding path program 1 times [2022-12-13 05:31:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:16,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105466693] [2022-12-13 05:31:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:16,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:16,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105466693] [2022-12-13 05:31:16,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105466693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:16,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:31:16,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:31:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223556043] [2022-12-13 05:31:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:16,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:31:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:31:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:31:16,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:31:16,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 40 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:16,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:31:16,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:16,792 INFO L130 PetriNetUnfolder]: 81/157 cut-off events. [2022-12-13 05:31:16,792 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 05:31:16,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 157 events. 81/157 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 454 event pairs, 8 based on Foata normal form. 4/126 useless extension candidates. Maximal degree in co-relation 622. Up to 136 conditions per place. [2022-12-13 05:31:16,794 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 49 selfloop transitions, 6 changer transitions 6/61 dead transitions. [2022-12-13 05:31:16,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 61 transitions, 623 flow [2022-12-13 05:31:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:31:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:31:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 05:31:16,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-13 05:31:16,796 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-13 05:31:16,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 61 transitions, 623 flow [2022-12-13 05:31:16,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 55 transitions, 567 flow [2022-12-13 05:31:16,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:16,798 INFO L89 Accepts]: Start accepts. Operand has 30 places, 55 transitions, 567 flow [2022-12-13 05:31:16,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:16,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:16,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 55 transitions, 567 flow [2022-12-13 05:31:16,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 55 transitions, 567 flow [2022-12-13 05:31:16,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:16,801 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:16,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:31:16,802 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 55 transitions, 567 flow [2022-12-13 05:31:16,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:16,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:16,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:16,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 05:31:16,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 350607946, now seen corresponding path program 2 times [2022-12-13 05:31:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:16,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228560473] [2022-12-13 05:31:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:16,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228560473] [2022-12-13 05:31:16,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228560473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:16,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981569871] [2022-12-13 05:31:16,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:31:16,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:16,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:16,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:16,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 05:31:17,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:31:17,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:17,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 05:31:17,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:17,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 05:31:17,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981569871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:17,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 05:31:17,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-12-13 05:31:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36298332] [2022-12-13 05:31:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:17,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:31:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:31:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:31:17,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 05:31:17,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 55 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:17,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:17,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 05:31:17,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:17,173 INFO L130 PetriNetUnfolder]: 86/162 cut-off events. [2022-12-13 05:31:17,174 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-13 05:31:17,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 162 events. 86/162 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 455 event pairs, 8 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 780. Up to 143 conditions per place. [2022-12-13 05:31:17,175 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 54 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2022-12-13 05:31:17,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:31:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:31:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 05:31:17,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 05:31:17,177 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-13 05:31:17,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:17,180 INFO L89 Accepts]: Start accepts. Operand has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:17,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:17,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:17,183 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:17,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:31:17,184 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 62 transitions, 756 flow [2022-12-13 05:31:17,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:17,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:17,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:17,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:17,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:17,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -193126582, now seen corresponding path program 2 times [2022-12-13 05:31:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:17,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233738428] [2022-12-13 05:31:17,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:17,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233738428] [2022-12-13 05:31:17,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233738428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:17,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391835367] [2022-12-13 05:31:17,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:31:17,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:17,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:17,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:17,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 05:31:17,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:31:17,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:17,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 05:31:17,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:17,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:17,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391835367] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:17,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 05:31:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2022-12-13 05:31:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427581430] [2022-12-13 05:31:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:31:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:31:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:31:17,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 05:31:17,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 62 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:17,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:17,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 05:31:17,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:17,728 INFO L130 PetriNetUnfolder]: 92/172 cut-off events. [2022-12-13 05:31:17,729 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 05:31:17,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 172 events. 92/172 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 495 event pairs, 8 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 976. Up to 153 conditions per place. [2022-12-13 05:31:17,730 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 58 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2022-12-13 05:31:17,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:31:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:31:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 05:31:17,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-13 05:31:17,732 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 05:31:17,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:17,735 INFO L89 Accepts]: Start accepts. Operand has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:17,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:17,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:17,738 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:17,739 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:31:17,739 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 67 transitions, 938 flow [2022-12-13 05:31:17,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:17,739 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:17,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:17,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:17,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 05:31:17,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:17,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash 476422342, now seen corresponding path program 3 times [2022-12-13 05:31:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:17,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634688957] [2022-12-13 05:31:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634688957] [2022-12-13 05:31:18,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634688957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378840091] [2022-12-13 05:31:18,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:31:18,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:18,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:18,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 05:31:18,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:31:18,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:18,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 05:31:18,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:18,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 05:31:18,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378840091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:18,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 05:31:18,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-12-13 05:31:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361130042] [2022-12-13 05:31:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:18,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:31:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:31:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 05:31:18,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 05:31:18,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 67 transitions, 938 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:18,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:18,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 05:31:18,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:18,263 INFO L130 PetriNetUnfolder]: 92/166 cut-off events. [2022-12-13 05:31:18,263 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-12-13 05:31:18,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 166 events. 92/166 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 455 event pairs, 8 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 1078. Up to 147 conditions per place. [2022-12-13 05:31:18,265 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 51 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2022-12-13 05:31:18,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:31:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:31:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 05:31:18,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-13 05:31:18,266 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 05:31:18,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:18,268 INFO L89 Accepts]: Start accepts. Operand has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:18,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:18,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:18,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:18,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 05:31:18,271 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 64 transitions, 1012 flow [2022-12-13 05:31:18,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:18,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:18,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:18,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:18,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:18,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -447047938, now seen corresponding path program 3 times [2022-12-13 05:31:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:18,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803495430] [2022-12-13 05:31:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:18,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803495430] [2022-12-13 05:31:18,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803495430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277896753] [2022-12-13 05:31:18,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:31:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:18,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:18,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:18,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 05:31:18,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:31:18,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:18,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 05:31:18,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:18,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 05:31:18,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277896753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:31:18,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 05:31:18,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 05:31:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563657330] [2022-12-13 05:31:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:31:18,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:31:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:31:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 05:31:18,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 05:31:18,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 64 transitions, 1012 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:18,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:18,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 05:31:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:18,704 INFO L130 PetriNetUnfolder]: 94/166 cut-off events. [2022-12-13 05:31:18,704 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-13 05:31:18,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 166 events. 94/166 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 441 event pairs, 8 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 1230. Up to 147 conditions per place. [2022-12-13 05:31:18,706 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 50 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2022-12-13 05:31:18,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:31:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:31:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 05:31:18,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 05:31:18,707 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-13 05:31:18,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:18,710 INFO L89 Accepts]: Start accepts. Operand has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:18,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:18,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:18,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:18,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 05:31:18,712 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 63 transitions, 1113 flow [2022-12-13 05:31:18,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:18,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:18,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:18,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:18,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:18,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash 303607259, now seen corresponding path program 1 times [2022-12-13 05:31:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:18,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935852095] [2022-12-13 05:31:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:19,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935852095] [2022-12-13 05:31:19,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935852095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900536899] [2022-12-13 05:31:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:19,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:19,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 05:31:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:19,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 05:31:19,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:19,260 INFO L321 Elim1Store]: treesize reduction 21, result has 57.1 percent of original size [2022-12-13 05:31:19,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 55 [2022-12-13 05:31:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:19,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:19,416 INFO L321 Elim1Store]: treesize reduction 5, result has 95.4 percent of original size [2022-12-13 05:31:19,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 98 treesize of output 137 [2022-12-13 05:31:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:19,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900536899] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:19,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:19,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 05:31:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604720402] [2022-12-13 05:31:19,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:19,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:31:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:19,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:31:19,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:31:19,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 05:31:19,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 63 transitions, 1113 flow. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:19,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:19,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 05:31:19,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:20,123 INFO L130 PetriNetUnfolder]: 287/505 cut-off events. [2022-12-13 05:31:20,123 INFO L131 PetriNetUnfolder]: For 1295/1295 co-relation queries the response was YES. [2022-12-13 05:31:20,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 505 events. 287/505 cut-off events. For 1295/1295 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2062 event pairs, 18 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 3154. Up to 450 conditions per place. [2022-12-13 05:31:20,126 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 58 selfloop transitions, 20 changer transitions 108/189 dead transitions. [2022-12-13 05:31:20,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 189 transitions, 3789 flow [2022-12-13 05:31:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 05:31:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 05:31:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 132 transitions. [2022-12-13 05:31:20,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4086687306501548 [2022-12-13 05:31:20,130 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-13 05:31:20,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 189 transitions, 3789 flow [2022-12-13 05:31:20,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 81 transitions, 1591 flow [2022-12-13 05:31:20,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:20,140 INFO L89 Accepts]: Start accepts. Operand has 50 places, 81 transitions, 1591 flow [2022-12-13 05:31:20,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:20,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:20,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 81 transitions, 1591 flow [2022-12-13 05:31:20,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 81 transitions, 1591 flow [2022-12-13 05:31:20,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:22,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_In_3 v_~size~0_In_9) (<= 0 v_~x1~0_In_3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= v_~x1~0_Out_6 (select (select |v_#memory_int_In_13| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_3 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) InVars {~size~0=v_~size~0_In_9, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_3, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_9, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_6, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [671] L88-3-->L89-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_38|) (= (store |v_#memory_int_109| |v_ULTIMATE.start_main_~#t2~0#1.base_39| (store (select |v_#memory_int_109| |v_ULTIMATE.start_main_~#t2~0#1.base_39|) |v_ULTIMATE.start_main_~#t2~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_108|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|} OutVars{#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, #memory_int=|v_#memory_int_108|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-13 05:31:22,265 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:31:22,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2125 [2022-12-13 05:31:22,266 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 78 transitions, 1541 flow [2022-12-13 05:31:22,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:22,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:22,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:22,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:22,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:22,473 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2140402955, now seen corresponding path program 1 times [2022-12-13 05:31:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:22,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58318992] [2022-12-13 05:31:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58318992] [2022-12-13 05:31:22,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58318992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617685183] [2022-12-13 05:31:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:22,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:22,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:22,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:22,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 05:31:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:22,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 05:31:22,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:22,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 05:31:22,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:22,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:22,850 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2022-12-13 05:31:22,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 101 [2022-12-13 05:31:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:22,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:22,994 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246) c_~f~0.base))) (let ((.cse1 (select .cse0 (+ (* (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) 4) c_~f~0.offset)) 4) c_~f~0.offset)))) (or (< ~x1~0 0) (= (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* .cse1 4)))) (< .cse1 0) (<= c_~size~0 .cse1) (<= c_~size~0 ~x1~0))))) is different from false [2022-12-13 05:31:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:23,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617685183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:23,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:23,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 05:31:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843759953] [2022-12-13 05:31:23,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:23,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 05:31:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 05:31:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2022-12-13 05:31:23,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 05:31:23,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 78 transitions, 1541 flow. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:23,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:23,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 05:31:23,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:23,279 INFO L130 PetriNetUnfolder]: 205/362 cut-off events. [2022-12-13 05:31:23,279 INFO L131 PetriNetUnfolder]: For 1060/1060 co-relation queries the response was YES. [2022-12-13 05:31:23,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3862 conditions, 362 events. 205/362 cut-off events. For 1060/1060 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1306 event pairs, 4 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 1761. Up to 331 conditions per place. [2022-12-13 05:31:23,282 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 99 selfloop transitions, 14 changer transitions 24/140 dead transitions. [2022-12-13 05:31:23,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 140 transitions, 3085 flow [2022-12-13 05:31:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 05:31:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 05:31:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 85 transitions. [2022-12-13 05:31:23,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37280701754385964 [2022-12-13 05:31:23,283 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-13 05:31:23,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 140 transitions, 3085 flow [2022-12-13 05:31:23,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 116 transitions, 2551 flow [2022-12-13 05:31:23,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:23,288 INFO L89 Accepts]: Start accepts. Operand has 54 places, 116 transitions, 2551 flow [2022-12-13 05:31:23,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:23,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:23,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 116 transitions, 2551 flow [2022-12-13 05:31:23,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 116 transitions, 2551 flow [2022-12-13 05:31:23,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:23,291 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:23,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:31:23,292 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 116 transitions, 2551 flow [2022-12-13 05:31:23,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:23,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:23,292 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:23,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:23,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:23,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash -280613750, now seen corresponding path program 2 times [2022-12-13 05:31:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:23,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283073481] [2022-12-13 05:31:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:23,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283073481] [2022-12-13 05:31:23,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283073481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376795086] [2022-12-13 05:31:23,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:31:23,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:23,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:23,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:23,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 05:31:23,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:31:23,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:23,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 05:31:23,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:23,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 05:31:23,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:23,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:23,889 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2022-12-13 05:31:23,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 101 [2022-12-13 05:31:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:23,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:24,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_284 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_284) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))) 4))) 4))))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* .cse0 4))) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))) (<= c_~size~0 .cse0))))) is different from false [2022-12-13 05:31:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:24,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376795086] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:24,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:24,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 05:31:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928467731] [2022-12-13 05:31:24,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:24,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 05:31:24,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 05:31:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=85, Unknown=1, NotChecked=18, Total=132 [2022-12-13 05:31:24,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 05:31:24,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 116 transitions, 2551 flow. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:24,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:24,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 05:31:24,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:24,386 INFO L130 PetriNetUnfolder]: 173/315 cut-off events. [2022-12-13 05:31:24,386 INFO L131 PetriNetUnfolder]: For 1421/1421 co-relation queries the response was YES. [2022-12-13 05:31:24,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 315 events. 173/315 cut-off events. For 1421/1421 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1130 event pairs, 4 based on Foata normal form. 5/273 useless extension candidates. Maximal degree in co-relation 1918. Up to 282 conditions per place. [2022-12-13 05:31:24,389 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 67 selfloop transitions, 5 changer transitions 52/127 dead transitions. [2022-12-13 05:31:24,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 127 transitions, 3044 flow [2022-12-13 05:31:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 05:31:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 05:31:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-12-13 05:31:24,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2022-12-13 05:31:24,390 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 42 predicate places. [2022-12-13 05:31:24,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 127 transitions, 3044 flow [2022-12-13 05:31:24,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 75 transitions, 1764 flow [2022-12-13 05:31:24,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:24,394 INFO L89 Accepts]: Start accepts. Operand has 50 places, 75 transitions, 1764 flow [2022-12-13 05:31:24,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:24,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:24,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 75 transitions, 1764 flow [2022-12-13 05:31:24,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 75 transitions, 1764 flow [2022-12-13 05:31:24,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:24,397 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:24,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:31:24,398 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 75 transitions, 1764 flow [2022-12-13 05:31:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:24,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:24,426 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:24,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:24,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:24,631 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -139820412, now seen corresponding path program 1 times [2022-12-13 05:31:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:24,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274775981] [2022-12-13 05:31:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:24,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:24,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274775981] [2022-12-13 05:31:24,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274775981] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:24,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471657431] [2022-12-13 05:31:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:24,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:24,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:24,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 05:31:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:24,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 05:31:24,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:24,959 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-13 05:31:24,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 48 [2022-12-13 05:31:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:24,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:25,201 INFO L321 Elim1Store]: treesize reduction 10, result has 93.6 percent of original size [2022-12-13 05:31:25,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 192 treesize of output 210 [2022-12-13 05:31:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:27,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471657431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:27,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:27,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 05:31:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308560006] [2022-12-13 05:31:27,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:27,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:31:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:27,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:31:27,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:31:27,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 05:31:27,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 75 transitions, 1764 flow. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:27,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:27,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 05:31:27,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:27,496 INFO L130 PetriNetUnfolder]: 219/388 cut-off events. [2022-12-13 05:31:27,496 INFO L131 PetriNetUnfolder]: For 1710/1710 co-relation queries the response was YES. [2022-12-13 05:31:27,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 388 events. 219/388 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1327 event pairs, 4 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 3807. Up to 353 conditions per place. [2022-12-13 05:31:27,500 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 105 selfloop transitions, 42 changer transitions 1/151 dead transitions. [2022-12-13 05:31:27,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 151 transitions, 3901 flow [2022-12-13 05:31:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:31:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:31:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-13 05:31:27,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4083044982698962 [2022-12-13 05:31:27,501 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2022-12-13 05:31:27,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 151 transitions, 3901 flow [2022-12-13 05:31:27,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 150 transitions, 3872 flow [2022-12-13 05:31:27,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:27,507 INFO L89 Accepts]: Start accepts. Operand has 66 places, 150 transitions, 3872 flow [2022-12-13 05:31:27,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:27,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:27,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 150 transitions, 3872 flow [2022-12-13 05:31:27,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 150 transitions, 3872 flow [2022-12-13 05:31:27,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:29,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:31:29,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1978 [2022-12-13 05:31:29,485 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 149 transitions, 3846 flow [2022-12-13 05:31:29,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:29,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:29,485 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:29,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 05:31:29,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 05:31:29,686 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2119209318, now seen corresponding path program 1 times [2022-12-13 05:31:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:29,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695379667] [2022-12-13 05:31:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:29,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695379667] [2022-12-13 05:31:29,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695379667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126955480] [2022-12-13 05:31:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:29,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:29,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 05:31:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:29,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 05:31:29,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:29,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:30,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126955480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:30,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:30,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 05:31:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681424273] [2022-12-13 05:31:30,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 05:31:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:30,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 05:31:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-13 05:31:30,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 05:31:30,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 149 transitions, 3846 flow. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:30,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:30,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 05:31:30,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:30,471 INFO L130 PetriNetUnfolder]: 331/576 cut-off events. [2022-12-13 05:31:30,471 INFO L131 PetriNetUnfolder]: For 3441/3441 co-relation queries the response was YES. [2022-12-13 05:31:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7760 conditions, 576 events. 331/576 cut-off events. For 3441/3441 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2174 event pairs, 4 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 6402. Up to 527 conditions per place. [2022-12-13 05:31:30,483 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 175 selfloop transitions, 50 changer transitions 0/228 dead transitions. [2022-12-13 05:31:30,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:31:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:31:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-12-13 05:31:30,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2022-12-13 05:31:30,486 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-13 05:31:30,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:30,501 INFO L89 Accepts]: Start accepts. Operand has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:30,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:30,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:30,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:30,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 05:31:30,508 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 228 transitions, 6368 flow [2022-12-13 05:31:30,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:30,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:30,509 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:30,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:30,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 05:31:30,714 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 662238011, now seen corresponding path program 2 times [2022-12-13 05:31:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:30,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652716497] [2022-12-13 05:31:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:32,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652716497] [2022-12-13 05:31:32,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652716497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:32,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145132617] [2022-12-13 05:31:32,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:31:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:32,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:32,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:32,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 05:31:32,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:31:32,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:32,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 05:31:32,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:33,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:31:33,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:31:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:33,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:33,490 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 05:31:33,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 05:31:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:34,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145132617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:34,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:34,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 16 [2022-12-13 05:31:34,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240760889] [2022-12-13 05:31:34,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:34,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 05:31:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 05:31:34,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-12-13 05:31:34,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:31:34,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 228 transitions, 6368 flow. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:34,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:34,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:31:34,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:35,624 INFO L130 PetriNetUnfolder]: 666/1166 cut-off events. [2022-12-13 05:31:35,624 INFO L131 PetriNetUnfolder]: For 5171/5171 co-relation queries the response was YES. [2022-12-13 05:31:35,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17093 conditions, 1166 events. 666/1166 cut-off events. For 5171/5171 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5211 event pairs, 6 based on Foata normal form. 3/941 useless extension candidates. Maximal degree in co-relation 13529. Up to 1107 conditions per place. [2022-12-13 05:31:35,641 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 328 selfloop transitions, 99 changer transitions 3/438 dead transitions. [2022-12-13 05:31:35,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 438 transitions, 13177 flow [2022-12-13 05:31:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:31:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:31:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 151 transitions. [2022-12-13 05:31:35,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4934640522875817 [2022-12-13 05:31:35,645 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-13 05:31:35,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 438 transitions, 13177 flow [2022-12-13 05:31:35,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 435 transitions, 13078 flow [2022-12-13 05:31:35,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:35,684 INFO L89 Accepts]: Start accepts. Operand has 91 places, 435 transitions, 13078 flow [2022-12-13 05:31:35,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:35,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:35,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 435 transitions, 13078 flow [2022-12-13 05:31:35,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 435 transitions, 13078 flow [2022-12-13 05:31:35,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:35,701 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:35,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 05:31:35,702 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 435 transitions, 13078 flow [2022-12-13 05:31:35,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:35,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:35,702 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:35,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:35,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 05:31:35,907 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash 318368373, now seen corresponding path program 3 times [2022-12-13 05:31:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:35,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699368587] [2022-12-13 05:31:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:37,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699368587] [2022-12-13 05:31:37,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699368587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:37,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941865705] [2022-12-13 05:31:37,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:31:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:37,397 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:37,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 05:31:37,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 05:31:37,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:37,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 05:31:37,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:37,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:31:37,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:31:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:37,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:38,054 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 05:31:38,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 05:31:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941865705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:38,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:38,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 16 [2022-12-13 05:31:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373667742] [2022-12-13 05:31:38,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:38,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 05:31:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:38,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 05:31:38,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-12-13 05:31:38,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:31:38,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 435 transitions, 13078 flow. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:38,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:38,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:31:38,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:40,145 INFO L130 PetriNetUnfolder]: 1162/2036 cut-off events. [2022-12-13 05:31:40,145 INFO L131 PetriNetUnfolder]: For 7115/7115 co-relation queries the response was YES. [2022-12-13 05:31:40,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32100 conditions, 2036 events. 1162/2036 cut-off events. For 7115/7115 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10529 event pairs, 14 based on Foata normal form. 6/1582 useless extension candidates. Maximal degree in co-relation 26260. Up to 1969 conditions per place. [2022-12-13 05:31:40,165 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 553 selfloop transitions, 167 changer transitions 6/734 dead transitions. [2022-12-13 05:31:40,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 734 transitions, 23599 flow [2022-12-13 05:31:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 05:31:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 05:31:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 153 transitions. [2022-12-13 05:31:40,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 05:31:40,168 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 85 predicate places. [2022-12-13 05:31:40,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 734 transitions, 23599 flow [2022-12-13 05:31:40,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 728 transitions, 23389 flow [2022-12-13 05:31:40,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:40,206 INFO L89 Accepts]: Start accepts. Operand has 106 places, 728 transitions, 23389 flow [2022-12-13 05:31:40,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:40,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:40,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 728 transitions, 23389 flow [2022-12-13 05:31:40,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 728 transitions, 23389 flow [2022-12-13 05:31:40,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:40,233 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:40,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 05:31:40,233 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 728 transitions, 23389 flow [2022-12-13 05:31:40,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:40,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:40,235 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:40,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:40,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 05:31:40,442 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -689386603, now seen corresponding path program 4 times [2022-12-13 05:31:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:40,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918621685] [2022-12-13 05:31:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:42,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918621685] [2022-12-13 05:31:42,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918621685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:42,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528338262] [2022-12-13 05:31:42,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:31:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:42,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:42,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:42,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 05:31:42,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:31:42,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:42,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 05:31:42,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:42,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:31:42,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:31:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:42,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:42,712 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-13 05:31:42,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-13 05:31:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528338262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:43,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:43,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2022-12-13 05:31:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451389425] [2022-12-13 05:31:43,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 05:31:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 05:31:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-12-13 05:31:43,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:31:43,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 728 transitions, 23389 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:43,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:43,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:31:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:45,428 INFO L130 PetriNetUnfolder]: 2012/3542 cut-off events. [2022-12-13 05:31:45,428 INFO L131 PetriNetUnfolder]: For 13318/13318 co-relation queries the response was YES. [2022-12-13 05:31:45,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59425 conditions, 3542 events. 2012/3542 cut-off events. For 13318/13318 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20772 event pairs, 2 based on Foata normal form. 10/2695 useless extension candidates. Maximal degree in co-relation 42097. Up to 3455 conditions per place. [2022-12-13 05:31:45,451 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 878 selfloop transitions, 270 changer transitions 89/1245 dead transitions. [2022-12-13 05:31:45,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1245 transitions, 42635 flow [2022-12-13 05:31:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:31:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:31:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2022-12-13 05:31:45,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5522875816993464 [2022-12-13 05:31:45,453 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-13 05:31:45,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 1245 transitions, 42635 flow [2022-12-13 05:31:45,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 1156 transitions, 39498 flow [2022-12-13 05:31:45,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:45,549 INFO L89 Accepts]: Start accepts. Operand has 122 places, 1156 transitions, 39498 flow [2022-12-13 05:31:45,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:45,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:45,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 1156 transitions, 39498 flow [2022-12-13 05:31:45,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 1156 transitions, 39498 flow [2022-12-13 05:31:45,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:45,583 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:45,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 05:31:45,584 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 1156 transitions, 39498 flow [2022-12-13 05:31:45,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:45,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:45,584 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:45,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:45,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 05:31:45,789 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:45,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1562705099, now seen corresponding path program 5 times [2022-12-13 05:31:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:45,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750232683] [2022-12-13 05:31:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:45,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:47,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750232683] [2022-12-13 05:31:47,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750232683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:47,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586824643] [2022-12-13 05:31:47,253 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 05:31:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:47,255 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:47,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 05:31:47,426 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 05:31:47,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:47,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 05:31:47,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:47,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:31:47,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 05:31:47,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:47,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:47,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:31:47,832 INFO L321 Elim1Store]: treesize reduction 103, result has 16.9 percent of original size [2022-12-13 05:31:47,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 65 [2022-12-13 05:31:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:31:47,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:48,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586824643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:48,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:48,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2022-12-13 05:31:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157935888] [2022-12-13 05:31:48,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:48,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 05:31:48,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:48,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 05:31:48,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=382, Unknown=1, NotChecked=0, Total=462 [2022-12-13 05:31:48,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:31:48,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1156 transitions, 39498 flow. Second operand has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:48,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:48,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:31:48,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:51,431 INFO L130 PetriNetUnfolder]: 2590/4601 cut-off events. [2022-12-13 05:31:51,432 INFO L131 PetriNetUnfolder]: For 14944/14944 co-relation queries the response was YES. [2022-12-13 05:31:51,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82011 conditions, 4601 events. 2590/4601 cut-off events. For 14944/14944 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 28277 event pairs, 2 based on Foata normal form. 11/3495 useless extension candidates. Maximal degree in co-relation 58278. Up to 4514 conditions per place. [2022-12-13 05:31:51,462 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 1359 selfloop transitions, 220 changer transitions 32/1619 dead transitions. [2022-12-13 05:31:51,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 1619 transitions, 58627 flow [2022-12-13 05:31:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 05:31:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 05:31:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 150 transitions. [2022-12-13 05:31:51,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-13 05:31:51,464 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-13 05:31:51,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 1619 transitions, 58627 flow [2022-12-13 05:31:51,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 1587 transitions, 57421 flow [2022-12-13 05:31:51,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:51,533 INFO L89 Accepts]: Start accepts. Operand has 139 places, 1587 transitions, 57421 flow [2022-12-13 05:31:51,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:51,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:51,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 1587 transitions, 57421 flow [2022-12-13 05:31:51,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 1587 transitions, 57421 flow [2022-12-13 05:31:51,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:51,634 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:51,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 05:31:51,635 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 1587 transitions, 57421 flow [2022-12-13 05:31:51,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:51,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:51,635 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:51,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:51,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 05:31:51,840 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1816464773, now seen corresponding path program 6 times [2022-12-13 05:31:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:51,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876974984] [2022-12-13 05:31:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:52,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876974984] [2022-12-13 05:31:52,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876974984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:52,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951065600] [2022-12-13 05:31:52,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 05:31:52,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:52,952 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:52,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 05:31:53,048 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 05:31:53,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:31:53,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 05:31:53,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:31:53,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 05:31:53,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:53,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:31:53,356 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-13 05:31:53,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 54 [2022-12-13 05:31:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:53,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:31:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:53,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951065600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:31:53,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:31:53,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 05:31:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24005921] [2022-12-13 05:31:53,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:31:53,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 05:31:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:31:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 05:31:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=381, Unknown=3, NotChecked=0, Total=462 [2022-12-13 05:31:53,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:31:53,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1587 transitions, 57421 flow. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:53,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:31:53,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:31:53,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:31:56,962 INFO L130 PetriNetUnfolder]: 3060/5403 cut-off events. [2022-12-13 05:31:56,962 INFO L131 PetriNetUnfolder]: For 17769/17769 co-relation queries the response was YES. [2022-12-13 05:31:56,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101770 conditions, 5403 events. 3060/5403 cut-off events. For 17769/17769 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 33696 event pairs, 2 based on Foata normal form. 13/4067 useless extension candidates. Maximal degree in co-relation 66101. Up to 5306 conditions per place. [2022-12-13 05:31:56,994 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 1694 selfloop transitions, 115 changer transitions 67/1884 dead transitions. [2022-12-13 05:31:56,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 1884 transitions, 72009 flow [2022-12-13 05:31:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 05:31:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 05:31:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 124 transitions. [2022-12-13 05:31:56,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5299145299145299 [2022-12-13 05:31:56,995 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 130 predicate places. [2022-12-13 05:31:56,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 1884 transitions, 72009 flow [2022-12-13 05:31:57,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 1817 transitions, 69370 flow [2022-12-13 05:31:57,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:31:57,072 INFO L89 Accepts]: Start accepts. Operand has 151 places, 1817 transitions, 69370 flow [2022-12-13 05:31:57,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:31:57,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:31:57,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 1817 transitions, 69370 flow [2022-12-13 05:31:57,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 1817 transitions, 69370 flow [2022-12-13 05:31:57,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:31:57,140 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:31:57,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 05:31:57,141 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 1817 transitions, 69370 flow [2022-12-13 05:31:57,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:31:57,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:31:57,141 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:31:57,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 05:31:57,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:57,346 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:31:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:31:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash -704563761, now seen corresponding path program 7 times [2022-12-13 05:31:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:31:57,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090524386] [2022-12-13 05:31:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:31:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:31:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:59,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:31:59,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090524386] [2022-12-13 05:31:59,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090524386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:31:59,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183413025] [2022-12-13 05:31:59,066 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 05:31:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:31:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:31:59,067 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:31:59,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 05:31:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:31:59,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 05:31:59,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:31:59,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:31:59,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 05:31:59,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:31:59,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:31:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:31:59,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:32:01,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:01,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 05:32:01,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:01,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 05:32:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:09,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183413025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:32:09,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:32:09,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:32:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674779191] [2022-12-13 05:32:09,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:32:09,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 05:32:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:32:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 05:32:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=362, Unknown=5, NotChecked=0, Total=420 [2022-12-13 05:32:09,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:32:09,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 1817 transitions, 69370 flow. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:32:09,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:32:09,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:32:09,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:32:15,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:32:18,530 INFO L130 PetriNetUnfolder]: 3137/5515 cut-off events. [2022-12-13 05:32:18,530 INFO L131 PetriNetUnfolder]: For 21004/21004 co-relation queries the response was YES. [2022-12-13 05:32:18,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109260 conditions, 5515 events. 3137/5515 cut-off events. For 21004/21004 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 34330 event pairs, 6 based on Foata normal form. 3/4197 useless extension candidates. Maximal degree in co-relation 70108. Up to 5416 conditions per place. [2022-12-13 05:32:18,566 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 1765 selfloop transitions, 190 changer transitions 12/1975 dead transitions. [2022-12-13 05:32:18,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1975 transitions, 79353 flow [2022-12-13 05:32:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 05:32:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 05:32:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 171 transitions. [2022-12-13 05:32:18,567 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-13 05:32:18,567 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 150 predicate places. [2022-12-13 05:32:18,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 1975 transitions, 79353 flow [2022-12-13 05:32:18,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 1963 transitions, 78855 flow [2022-12-13 05:32:18,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:32:18,648 INFO L89 Accepts]: Start accepts. Operand has 171 places, 1963 transitions, 78855 flow [2022-12-13 05:32:18,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:32:18,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:32:18,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 1963 transitions, 78855 flow [2022-12-13 05:32:18,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 1963 transitions, 78855 flow [2022-12-13 05:32:18,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:32:18,711 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:32:18,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 05:32:18,711 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 1963 transitions, 78855 flow [2022-12-13 05:32:18,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:32:18,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:32:18,712 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:32:18,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 05:32:18,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:32:18,916 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:32:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:32:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash -983299515, now seen corresponding path program 8 times [2022-12-13 05:32:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:32:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549101716] [2022-12-13 05:32:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:32:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:32:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:32:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:32:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549101716] [2022-12-13 05:32:20,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549101716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:32:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137203510] [2022-12-13 05:32:20,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:32:20,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:32:20,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:32:20,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:32:20,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 05:32:20,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:32:20,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:32:20,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 05:32:20,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:32:20,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:32:20,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 05:32:20,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:20,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:32:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:20,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:32:20,947 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_632) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset))))) 4))) 4)))))) is different from false [2022-12-13 05:32:21,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:21,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 05:32:21,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:21,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 05:32:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:28,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137203510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:32:28,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:32:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:32:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712676152] [2022-12-13 05:32:28,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:32:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 05:32:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:32:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 05:32:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=333, Unknown=1, NotChecked=36, Total=420 [2022-12-13 05:32:28,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:32:28,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 1963 transitions, 78855 flow. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:32:28,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:32:28,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:32:28,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:32:32,720 INFO L130 PetriNetUnfolder]: 3479/6113 cut-off events. [2022-12-13 05:32:32,720 INFO L131 PetriNetUnfolder]: For 24668/24668 co-relation queries the response was YES. [2022-12-13 05:32:32,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127228 conditions, 6113 events. 3479/6113 cut-off events. For 24668/24668 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 38936 event pairs, 8 based on Foata normal form. 2/4646 useless extension candidates. Maximal degree in co-relation 84314. Up to 6012 conditions per place. [2022-12-13 05:32:32,772 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 1889 selfloop transitions, 294 changer transitions 2/2193 dead transitions. [2022-12-13 05:32:32,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 2193 transitions, 92494 flow [2022-12-13 05:32:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:32:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:32:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 151 transitions. [2022-12-13 05:32:32,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4934640522875817 [2022-12-13 05:32:32,773 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-13 05:32:32,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 2193 transitions, 92494 flow [2022-12-13 05:32:32,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 2191 transitions, 92404 flow [2022-12-13 05:32:32,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:32:32,987 INFO L89 Accepts]: Start accepts. Operand has 187 places, 2191 transitions, 92404 flow [2022-12-13 05:32:33,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:32:33,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:32:33,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 2191 transitions, 92404 flow [2022-12-13 05:32:33,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 2191 transitions, 92404 flow [2022-12-13 05:32:33,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:32:33,086 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:32:33,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 05:32:33,087 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 2191 transitions, 92404 flow [2022-12-13 05:32:33,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:32:33,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:32:33,087 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:32:33,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 05:32:33,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:32:33,292 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:32:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:32:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1327169153, now seen corresponding path program 9 times [2022-12-13 05:32:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:32:33,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700212158] [2022-12-13 05:32:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:32:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:32:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:32:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:32:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700212158] [2022-12-13 05:32:34,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700212158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:32:34,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867307761] [2022-12-13 05:32:34,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:32:34,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:32:34,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:32:34,815 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:32:34,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 05:32:34,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 05:32:34,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:32:34,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 05:32:34,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:32:34,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:32:34,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 05:32:35,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:35,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:32:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:35,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:32:35,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:35,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 05:32:35,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:35,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 05:32:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:44,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867307761] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:32:44,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:32:44,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:32:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430694923] [2022-12-13 05:32:44,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:32:44,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 05:32:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:32:44,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 05:32:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=360, Unknown=2, NotChecked=0, Total=420 [2022-12-13 05:32:44,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:32:44,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 2191 transitions, 92404 flow. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:32:44,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:32:44,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:32:44,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:32:48,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:32:54,255 INFO L130 PetriNetUnfolder]: 4249/7542 cut-off events. [2022-12-13 05:32:54,255 INFO L131 PetriNetUnfolder]: For 28778/28778 co-relation queries the response was YES. [2022-12-13 05:32:54,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164717 conditions, 7542 events. 4249/7542 cut-off events. For 28778/28778 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 50842 event pairs, 20 based on Foata normal form. 4/5731 useless extension candidates. Maximal degree in co-relation 114280. Up to 7439 conditions per place. [2022-12-13 05:32:54,316 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 2305 selfloop transitions, 466 changer transitions 4/2783 dead transitions. [2022-12-13 05:32:54,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 2783 transitions, 122980 flow [2022-12-13 05:32:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 05:32:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 05:32:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2022-12-13 05:32:54,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2022-12-13 05:32:54,318 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 184 predicate places. [2022-12-13 05:32:54,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 2783 transitions, 122980 flow [2022-12-13 05:32:54,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 2779 transitions, 122792 flow [2022-12-13 05:32:54,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:32:54,459 INFO L89 Accepts]: Start accepts. Operand has 205 places, 2779 transitions, 122792 flow [2022-12-13 05:32:54,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:32:54,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:32:54,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 2779 transitions, 122792 flow [2022-12-13 05:32:54,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 2779 transitions, 122792 flow [2022-12-13 05:32:54,574 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:32:54,579 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:32:54,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 05:32:54,580 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 2779 transitions, 122792 flow [2022-12-13 05:32:54,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:32:54,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:32:54,580 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:32:54,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 05:32:54,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:32:54,785 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:32:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:32:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2125383217, now seen corresponding path program 10 times [2022-12-13 05:32:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:32:54,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109103809] [2022-12-13 05:32:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:32:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:32:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:32:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:32:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109103809] [2022-12-13 05:32:56,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109103809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:32:56,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663419281] [2022-12-13 05:32:56,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:32:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:32:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:32:56,015 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:32:56,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 05:32:56,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:32:56,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:32:56,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 05:32:56,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:32:56,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:32:56,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 05:32:56,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:56,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:32:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:32:56,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:32:58,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:58,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 05:32:58,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:32:58,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 05:33:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:05,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663419281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:33:05,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:33:05,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:33:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629086093] [2022-12-13 05:33:05,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:33:05,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 05:33:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:33:05,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 05:33:05,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=359, Unknown=6, NotChecked=0, Total=420 [2022-12-13 05:33:05,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:33:05,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 2779 transitions, 122792 flow. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:33:05,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:33:05,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:33:05,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:33:10,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:17,581 INFO L130 PetriNetUnfolder]: 4555/8081 cut-off events. [2022-12-13 05:33:17,581 INFO L131 PetriNetUnfolder]: For 40790/40790 co-relation queries the response was YES. [2022-12-13 05:33:17,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184165 conditions, 8081 events. 4555/8081 cut-off events. For 40790/40790 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 55374 event pairs, 16 based on Foata normal form. 6/6149 useless extension candidates. Maximal degree in co-relation 129245. Up to 7978 conditions per place. [2022-12-13 05:33:17,648 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 2249 selfloop transitions, 653 changer transitions 63/2973 dead transitions. [2022-12-13 05:33:17,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 2973 transitions, 137345 flow [2022-12-13 05:33:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 05:33:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 05:33:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 183 transitions. [2022-12-13 05:33:17,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2022-12-13 05:33:17,655 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2022-12-13 05:33:17,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 2973 transitions, 137345 flow [2022-12-13 05:33:17,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 2910 transitions, 134372 flow [2022-12-13 05:33:17,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:33:17,912 INFO L89 Accepts]: Start accepts. Operand has 223 places, 2910 transitions, 134372 flow [2022-12-13 05:33:17,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:33:17,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:33:17,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 2910 transitions, 134372 flow [2022-12-13 05:33:18,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 2910 transitions, 134372 flow [2022-12-13 05:33:18,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:33:18,033 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:33:18,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 05:33:18,033 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 2910 transitions, 134372 flow [2022-12-13 05:33:18,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:33:18,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:33:18,034 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:33:18,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 05:33:18,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:33:18,239 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:33:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:33:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 940200951, now seen corresponding path program 11 times [2022-12-13 05:33:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:33:18,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71029085] [2022-12-13 05:33:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:33:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:33:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:33:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:33:19,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71029085] [2022-12-13 05:33:19,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71029085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:33:19,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190452110] [2022-12-13 05:33:19,879 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 05:33:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:33:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:33:19,881 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:33:19,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 05:33:19,997 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 05:33:19,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:33:19,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 05:33:20,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:33:20,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:33:20,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 05:33:20,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:33:20,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:33:20,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 05:33:20,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:33:20,432 INFO L321 Elim1Store]: treesize reduction 171, result has 26.3 percent of original size [2022-12-13 05:33:20,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 109 [2022-12-13 05:33:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:20,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:33:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:21,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190452110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:33:21,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:33:21,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:33:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395960247] [2022-12-13 05:33:21,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:33:21,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 05:33:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:33:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 05:33:21,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=364, Unknown=1, NotChecked=0, Total=420 [2022-12-13 05:33:21,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 05:33:21,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 2910 transitions, 134372 flow. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:33:21,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:33:21,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 05:33:21,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:33:25,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 05:33:28,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:33,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:36,836 INFO L130 PetriNetUnfolder]: 4519/8031 cut-off events. [2022-12-13 05:33:36,836 INFO L131 PetriNetUnfolder]: For 49131/49131 co-relation queries the response was YES. [2022-12-13 05:33:36,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190748 conditions, 8031 events. 4519/8031 cut-off events. For 49131/49131 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 54938 event pairs, 6 based on Foata normal form. 1/6155 useless extension candidates. Maximal degree in co-relation 134732. Up to 7928 conditions per place. [2022-12-13 05:33:36,900 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 2838 selfloop transitions, 143 changer transitions 1/2990 dead transitions. [2022-12-13 05:33:36,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 2990 transitions, 144055 flow [2022-12-13 05:33:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 05:33:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 05:33:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 144 transitions. [2022-12-13 05:33:36,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-13 05:33:36,901 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 220 predicate places. [2022-12-13 05:33:36,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 2990 transitions, 144055 flow [2022-12-13 05:33:36,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 2989 transitions, 144004 flow [2022-12-13 05:33:37,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:33:37,053 INFO L89 Accepts]: Start accepts. Operand has 241 places, 2989 transitions, 144004 flow [2022-12-13 05:33:37,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:33:37,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:33:37,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 2989 transitions, 144004 flow [2022-12-13 05:33:37,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 2989 transitions, 144004 flow [2022-12-13 05:33:37,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:33:39,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:33:39,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1987 [2022-12-13 05:33:39,040 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 2988 transitions, 143956 flow [2022-12-13 05:33:39,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:33:39,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:33:39,040 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:33:39,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 05:33:39,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:33:39,246 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:33:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:33:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1098656523, now seen corresponding path program 12 times [2022-12-13 05:33:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:33:39,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481263105] [2022-12-13 05:33:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:33:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:33:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:33:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:33:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481263105] [2022-12-13 05:33:41,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481263105] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:33:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365553564] [2022-12-13 05:33:41,288 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 05:33:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:33:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:33:41,290 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:33:41,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 05:33:41,406 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 05:33:41,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:33:41,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 05:33:41,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:33:41,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:33:41,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 05:33:41,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:33:41,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:33:41,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 05:33:41,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:33:41,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 76 [2022-12-13 05:33:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:41,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:33:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:33:42,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365553564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:33:42,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:33:42,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-13 05:33:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476948424] [2022-12-13 05:33:42,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:33:42,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 05:33:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:33:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 05:33:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=384, Unknown=21, NotChecked=0, Total=462 [2022-12-13 05:33:42,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-13 05:33:42,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 2988 transitions, 143956 flow. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:33:42,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:33:42,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-13 05:33:42,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:33:42,197 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_796 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_796) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* 4 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset))))))) (or (not (< .cse0 c_~size~0)) (= (select .cse1 (+ (* 4 (select .cse1 (+ c_~f~0.offset (* (let ((.cse2 (select |c_#memory_int| c_~f~0.base))) (select .cse2 (+ c_~f~0.offset (* (select .cse2 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))) 4)))) c_~f~0.offset)) (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ (* .cse0 4) c_~f~0.offset)) 4)))) (not (<= 0 .cse0)))))) (= c_~x1~0 c_~x2~0)) is different from false [2022-12-13 05:33:47,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:49,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:51,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:53,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:33:56,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:34:00,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:34:03,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:34:09,325 INFO L130 PetriNetUnfolder]: 4960/8753 cut-off events. [2022-12-13 05:34:09,325 INFO L131 PetriNetUnfolder]: For 71425/71425 co-relation queries the response was YES. [2022-12-13 05:34:09,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215938 conditions, 8753 events. 4960/8753 cut-off events. For 71425/71425 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 60391 event pairs, 7 based on Foata normal form. 2/6714 useless extension candidates. Maximal degree in co-relation 152529. Up to 8636 conditions per place. [2022-12-13 05:34:09,393 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 2938 selfloop transitions, 365 changer transitions 29/3340 dead transitions. [2022-12-13 05:34:09,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 3340 transitions, 167621 flow [2022-12-13 05:34:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 05:34:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 05:34:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 179 transitions. [2022-12-13 05:34:09,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4096109839816934 [2022-12-13 05:34:09,395 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 241 predicate places. [2022-12-13 05:34:09,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 3340 transitions, 167621 flow [2022-12-13 05:34:09,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 3311 transitions, 166138 flow [2022-12-13 05:34:09,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:34:09,572 INFO L89 Accepts]: Start accepts. Operand has 262 places, 3311 transitions, 166138 flow [2022-12-13 05:34:09,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:34:09,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:34:09,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 262 places, 3311 transitions, 166138 flow [2022-12-13 05:34:09,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 3311 transitions, 166138 flow [2022-12-13 05:34:09,713 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:34:09,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_In_3 v_~size~0_In_9) (<= 0 v_~x1~0_In_3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= v_~x1~0_Out_6 (select (select |v_#memory_int_In_13| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_3 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) InVars {~size~0=v_~size~0_In_9, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_3, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_9, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_6, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [671] L88-3-->L89-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_38|) (= (store |v_#memory_int_109| |v_ULTIMATE.start_main_~#t2~0#1.base_39| (store (select |v_#memory_int_109| |v_ULTIMATE.start_main_~#t2~0#1.base_39|) |v_ULTIMATE.start_main_~#t2~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_108|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|} OutVars{#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, #memory_int=|v_#memory_int_108|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-13 05:34:10,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_In_3 v_~size~0_In_9) (<= 0 v_~x1~0_In_3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (= v_~x1~0_Out_6 (select (select |v_#memory_int_In_13| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_3 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) InVars {~size~0=v_~size~0_In_9, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #memory_int=|v_#memory_int_In_13|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_3, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_9, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_13|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_6, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [671] L88-3-->L89-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_33| |v_#pthreadsForks_38|) (= (store |v_#memory_int_109| |v_ULTIMATE.start_main_~#t2~0#1.base_39| (store (select |v_#memory_int_109| |v_ULTIMATE.start_main_~#t2~0#1.base_39|) |v_ULTIMATE.start_main_~#t2~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre16#1_33|)) |v_#memory_int_108|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|} OutVars{#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, #memory_int=|v_#memory_int_108|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-13 05:34:13,517 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 05:34:13,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3947 [2022-12-13 05:34:13,518 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 3308 transitions, 165992 flow [2022-12-13 05:34:13,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:34:13,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:34:13,518 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:34:13,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 05:34:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 05:34:13,723 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:34:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:34:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1285547839, now seen corresponding path program 13 times [2022-12-13 05:34:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:34:13,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147138516] [2022-12-13 05:34:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:34:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:34:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:34:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:34:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:34:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147138516] [2022-12-13 05:34:15,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147138516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:34:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979149125] [2022-12-13 05:34:15,543 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 05:34:15,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:34:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:34:15,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:34:15,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 05:34:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:34:15,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 05:34:15,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:34:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:34:15,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 05:34:15,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:34:15,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:34:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:34:15,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:34:16,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:34:16,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 376 [2022-12-13 05:34:16,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:34:16,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 196 [2022-12-13 05:34:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:34:21,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979149125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:34:21,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:34:21,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 05:34:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120880694] [2022-12-13 05:34:21,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:34:21,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 05:34:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:34:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 05:34:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=360, Unknown=2, NotChecked=0, Total=420 [2022-12-13 05:34:21,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:34:21,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 3308 transitions, 165992 flow. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:34:21,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:34:21,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:34:21,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:34:22,748 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4))) 4))) (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)))))))) (= c_~x1~0 c_~x2~0)) is different from false [2022-12-13 05:34:27,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:34:36,620 INFO L130 PetriNetUnfolder]: 5242/9229 cut-off events. [2022-12-13 05:34:36,620 INFO L131 PetriNetUnfolder]: For 85237/85237 co-relation queries the response was YES. [2022-12-13 05:34:36,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236642 conditions, 9229 events. 5242/9229 cut-off events. For 85237/85237 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 63763 event pairs, 4 based on Foata normal form. 3/7100 useless extension candidates. Maximal degree in co-relation 160692. Up to 9098 conditions per place. [2022-12-13 05:34:36,706 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 3271 selfloop transitions, 351 changer transitions 3/3633 dead transitions. [2022-12-13 05:34:36,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 3633 transitions, 189540 flow [2022-12-13 05:34:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 05:34:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 05:34:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 167 transitions. [2022-12-13 05:34:36,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31568998109640833 [2022-12-13 05:34:36,708 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 260 predicate places. [2022-12-13 05:34:36,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 3633 transitions, 189540 flow [2022-12-13 05:34:36,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 3630 transitions, 189375 flow [2022-12-13 05:34:36,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:34:36,955 INFO L89 Accepts]: Start accepts. Operand has 281 places, 3630 transitions, 189375 flow [2022-12-13 05:34:37,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:34:37,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:34:37,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 3630 transitions, 189375 flow [2022-12-13 05:34:37,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 3630 transitions, 189375 flow [2022-12-13 05:34:37,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:34:37,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:34:37,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 05:34:37,189 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 3630 transitions, 189375 flow [2022-12-13 05:34:37,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:34:37,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:34:37,190 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:34:37,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 05:34:37,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 05:34:37,396 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:34:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:34:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 880867465, now seen corresponding path program 1 times [2022-12-13 05:34:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:34:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476686554] [2022-12-13 05:34:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:34:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:34:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:34:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:34:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:34:43,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476686554] [2022-12-13 05:34:43,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476686554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:34:43,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248180185] [2022-12-13 05:34:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:34:43,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:34:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:34:43,086 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:34:43,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 05:34:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:34:43,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 05:34:43,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:34:43,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:34:43,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 05:34:43,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:34:43,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:34:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:34:43,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:34:43,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:34:43,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 376 [2022-12-13 05:34:43,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:34:43,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 196 [2022-12-13 05:34:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:34:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248180185] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:34:47,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:34:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 05:34:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523449411] [2022-12-13 05:34:47,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:34:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:34:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:34:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:34:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:34:47,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:34:47,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 3630 transitions, 189375 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:34:47,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:34:47,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:34:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:34:59,057 INFO L130 PetriNetUnfolder]: 5313/9351 cut-off events. [2022-12-13 05:34:59,058 INFO L131 PetriNetUnfolder]: For 94840/94840 co-relation queries the response was YES. [2022-12-13 05:34:59,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248908 conditions, 9351 events. 5313/9351 cut-off events. For 94840/94840 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 64720 event pairs, 4 based on Foata normal form. 1/7188 useless extension candidates. Maximal degree in co-relation 166850. Up to 9204 conditions per place. [2022-12-13 05:34:59,133 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 3594 selfloop transitions, 74 changer transitions 1/3677 dead transitions. [2022-12-13 05:34:59,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 3677 transitions, 199166 flow [2022-12-13 05:34:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:34:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:34:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-12-13 05:34:59,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35968379446640314 [2022-12-13 05:34:59,134 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 270 predicate places. [2022-12-13 05:34:59,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 3677 transitions, 199166 flow [2022-12-13 05:34:59,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 3676 transitions, 199109 flow [2022-12-13 05:34:59,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:34:59,322 INFO L89 Accepts]: Start accepts. Operand has 291 places, 3676 transitions, 199109 flow [2022-12-13 05:34:59,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:34:59,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:34:59,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 3676 transitions, 199109 flow [2022-12-13 05:34:59,484 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 3676 transitions, 199109 flow [2022-12-13 05:34:59,484 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:34:59,488 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:34:59,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 05:34:59,489 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 3676 transitions, 199109 flow [2022-12-13 05:34:59,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:34:59,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:34:59,489 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:34:59,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 05:34:59,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 05:34:59,694 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:34:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:34:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash 367051865, now seen corresponding path program 2 times [2022-12-13 05:34:59,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:34:59,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948711203] [2022-12-13 05:34:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:34:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:34:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:35:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:35:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948711203] [2022-12-13 05:35:02,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948711203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:35:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112364927] [2022-12-13 05:35:02,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:35:02,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:35:02,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:35:02,240 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:35:02,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 05:35:02,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:35:02,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:35:02,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 05:35:02,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:35:02,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:35:02,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 05:35:02,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:02,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:35:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:02,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:35:02,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:02,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 376 [2022-12-13 05:35:02,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:02,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 196 [2022-12-13 05:35:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:06,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112364927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:35:06,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:35:06,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 05:35:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946203302] [2022-12-13 05:35:06,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:35:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:35:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:35:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:35:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:35:06,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:35:06,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 3676 transitions, 199109 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:35:06,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:35:06,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:35:06,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:35:21,313 INFO L130 PetriNetUnfolder]: 5413/9519 cut-off events. [2022-12-13 05:35:21,314 INFO L131 PetriNetUnfolder]: For 106414/106414 co-relation queries the response was YES. [2022-12-13 05:35:21,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262626 conditions, 9519 events. 5413/9519 cut-off events. For 106414/106414 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 66027 event pairs, 6 based on Foata normal form. 1/7318 useless extension candidates. Maximal degree in co-relation 174616. Up to 9328 conditions per place. [2022-12-13 05:35:21,400 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 3662 selfloop transitions, 67 changer transitions 1/3738 dead transitions. [2022-12-13 05:35:21,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 3738 transitions, 209923 flow [2022-12-13 05:35:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 05:35:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 05:35:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 90 transitions. [2022-12-13 05:35:21,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3557312252964427 [2022-12-13 05:35:21,402 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 280 predicate places. [2022-12-13 05:35:21,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 3738 transitions, 209923 flow [2022-12-13 05:35:21,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 3737 transitions, 209864 flow [2022-12-13 05:35:21,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:35:21,743 INFO L89 Accepts]: Start accepts. Operand has 301 places, 3737 transitions, 209864 flow [2022-12-13 05:35:21,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:35:21,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:35:21,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 3737 transitions, 209864 flow [2022-12-13 05:35:21,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 3737 transitions, 209864 flow [2022-12-13 05:35:21,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:35:21,936 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:35:21,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-13 05:35:21,936 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 3737 transitions, 209864 flow [2022-12-13 05:35:21,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:35:21,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:35:21,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:35:21,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 05:35:22,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:35:22,142 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:35:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:35:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -134564092, now seen corresponding path program 1 times [2022-12-13 05:35:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:35:22,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112140886] [2022-12-13 05:35:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:35:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:35:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:35:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:35:24,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112140886] [2022-12-13 05:35:24,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112140886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:35:24,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168198473] [2022-12-13 05:35:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:35:24,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:35:24,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:35:24,536 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:35:24,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 05:35:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:35:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 05:35:24,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:35:24,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:35:24,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 05:35:24,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:24,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:35:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:24,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:35:24,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_964 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_964) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4))) 4))) (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset))))) is different from false [2022-12-13 05:35:25,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:25,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 05:35:25,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:25,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 05:35:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:28,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168198473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:35:28,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:35:28,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 05:35:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29942473] [2022-12-13 05:35:28,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:35:28,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:35:28,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:35:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:35:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2022-12-13 05:35:28,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:35:28,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 3737 transitions, 209864 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:35:28,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:35:28,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:35:28,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:35:42,243 INFO L130 PetriNetUnfolder]: 5442/9569 cut-off events. [2022-12-13 05:35:42,244 INFO L131 PetriNetUnfolder]: For 117567/117567 co-relation queries the response was YES. [2022-12-13 05:35:42,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273348 conditions, 9569 events. 5442/9569 cut-off events. For 117567/117567 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 66407 event pairs, 12 based on Foata normal form. 1/7356 useless extension candidates. Maximal degree in co-relation 181132. Up to 9378 conditions per place. [2022-12-13 05:35:42,330 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 3714 selfloop transitions, 32 changer transitions 1/3755 dead transitions. [2022-12-13 05:35:42,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 3755 transitions, 218375 flow [2022-12-13 05:35:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:35:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:35:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-13 05:35:42,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4161490683229814 [2022-12-13 05:35:42,332 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 286 predicate places. [2022-12-13 05:35:42,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 3755 transitions, 218375 flow [2022-12-13 05:35:42,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 307 places, 3754 transitions, 218314 flow [2022-12-13 05:35:42,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:35:42,573 INFO L89 Accepts]: Start accepts. Operand has 307 places, 3754 transitions, 218314 flow [2022-12-13 05:35:42,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:35:42,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:35:42,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 3754 transitions, 218314 flow [2022-12-13 05:35:42,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 3754 transitions, 218314 flow [2022-12-13 05:35:42,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:35:42,889 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:35:42,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-13 05:35:42,890 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 3754 transitions, 218314 flow [2022-12-13 05:35:42,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:35:42,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:35:42,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:35:42,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 05:35:43,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 05:35:43,096 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:35:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:35:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2007516122, now seen corresponding path program 2 times [2022-12-13 05:35:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:35:43,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8853823] [2022-12-13 05:35:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:35:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:35:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:35:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:48,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:35:48,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8853823] [2022-12-13 05:35:48,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8853823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:35:48,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532953339] [2022-12-13 05:35:48,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:35:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:35:48,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:35:48,538 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:35:48,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 05:35:48,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:35:48,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:35:48,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 05:35:48,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:35:48,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:35:48,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 05:35:48,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:48,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:35:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:48,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:35:48,844 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1007 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1007) c_~f~0.base))) (= (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-13 05:35:49,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:49,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-13 05:35:49,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:35:49,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 05:35:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:35:51,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532953339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:35:51,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:35:51,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 05:35:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636873394] [2022-12-13 05:35:51,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:35:51,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:35:51,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:35:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:35:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2022-12-13 05:35:51,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:35:51,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 3754 transitions, 218314 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:35:51,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:35:51,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:35:51,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:04,538 INFO L130 PetriNetUnfolder]: 5486/9647 cut-off events. [2022-12-13 05:36:04,538 INFO L131 PetriNetUnfolder]: For 131627/131627 co-relation queries the response was YES. [2022-12-13 05:36:04,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284911 conditions, 9647 events. 5486/9647 cut-off events. For 131627/131627 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 67043 event pairs, 12 based on Foata normal form. 1/7416 useless extension candidates. Maximal degree in co-relation 187356. Up to 9456 conditions per place. [2022-12-13 05:36:04,623 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 3737 selfloop transitions, 37 changer transitions 1/3783 dead transitions. [2022-12-13 05:36:04,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 3783 transitions, 227564 flow [2022-12-13 05:36:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 05:36:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 05:36:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 05:36:04,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4409937888198758 [2022-12-13 05:36:04,625 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 292 predicate places. [2022-12-13 05:36:04,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 313 places, 3783 transitions, 227564 flow [2022-12-13 05:36:04,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 3782 transitions, 227501 flow [2022-12-13 05:36:04,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:04,957 INFO L89 Accepts]: Start accepts. Operand has 313 places, 3782 transitions, 227501 flow [2022-12-13 05:36:05,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:05,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:05,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 3782 transitions, 227501 flow [2022-12-13 05:36:05,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 3782 transitions, 227501 flow [2022-12-13 05:36:05,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:05,131 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:05,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-13 05:36:05,131 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 3782 transitions, 227501 flow [2022-12-13 05:36:05,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:05,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:05,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:05,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 05:36:05,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 05:36:05,336 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -951872718, now seen corresponding path program 3 times [2022-12-13 05:36:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208145241] [2022-12-13 05:36:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:06,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208145241] [2022-12-13 05:36:06,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208145241] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:36:06,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329603711] [2022-12-13 05:36:06,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:36:06,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:36:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:36:06,147 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:36:06,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 05:36:06,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:36:06,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:36:06,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 05:36:06,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:36:06,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:36:06,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 05:36:06,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:36:06,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:36:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:06,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:36:06,502 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1050) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* 4 (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset))) c_~f~0.offset)) 4)))) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)))) is different from false [2022-12-13 05:36:06,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:36:06,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 364 [2022-12-13 05:36:06,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:36:06,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 05:36:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 05:36:08,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329603711] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:36:08,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:36:08,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 05:36:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190733712] [2022-12-13 05:36:08,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:36:08,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:36:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:36:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=148, Unknown=3, NotChecked=24, Total=210 [2022-12-13 05:36:08,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:36:08,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 3782 transitions, 227501 flow. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:08,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:08,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:36:08,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:21,951 INFO L130 PetriNetUnfolder]: 5520/9707 cut-off events. [2022-12-13 05:36:21,951 INFO L131 PetriNetUnfolder]: For 146735/146735 co-relation queries the response was YES. [2022-12-13 05:36:21,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296059 conditions, 9707 events. 5520/9707 cut-off events. For 146735/146735 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 67527 event pairs, 4 based on Foata normal form. 1/7461 useless extension candidates. Maximal degree in co-relation 193580. Up to 9516 conditions per place. [2022-12-13 05:36:22,044 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 3752 selfloop transitions, 41 changer transitions 1/3802 dead transitions. [2022-12-13 05:36:22,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 3802 transitions, 236304 flow [2022-12-13 05:36:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 05:36:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 05:36:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 05:36:22,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-13 05:36:22,045 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2022-12-13 05:36:22,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 3802 transitions, 236304 flow [2022-12-13 05:36:22,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 3801 transitions, 236239 flow [2022-12-13 05:36:22,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:22,273 INFO L89 Accepts]: Start accepts. Operand has 320 places, 3801 transitions, 236239 flow [2022-12-13 05:36:22,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:22,374 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:22,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 3801 transitions, 236239 flow [2022-12-13 05:36:22,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 3801 transitions, 236239 flow [2022-12-13 05:36:22,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:22,487 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:22,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 05:36:22,487 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 3801 transitions, 236239 flow [2022-12-13 05:36:22,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:22,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:22,488 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:22,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 05:36:22,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:36:22,692 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2076976560, now seen corresponding path program 3 times [2022-12-13 05:36:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:22,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173877609] [2022-12-13 05:36:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:22,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173877609] [2022-12-13 05:36:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173877609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:36:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715445076] [2022-12-13 05:36:22,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:36:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:36:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:36:22,819 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:36:22,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 05:36:23,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 05:36:23,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:36:23,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 05:36:23,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:36:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:23,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:36:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:23,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715445076] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:36:23,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:36:23,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 05:36:23,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352481491] [2022-12-13 05:36:23,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:36:23,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 05:36:23,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 05:36:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 05:36:23,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:36:23,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 3801 transitions, 236239 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:23,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:23,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:36:23,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:36:38,898 INFO L130 PetriNetUnfolder]: 5645/10057 cut-off events. [2022-12-13 05:36:38,898 INFO L131 PetriNetUnfolder]: For 148044/148044 co-relation queries the response was YES. [2022-12-13 05:36:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316863 conditions, 10057 events. 5645/10057 cut-off events. For 148044/148044 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 71694 event pairs, 0 based on Foata normal form. 0/7798 useless extension candidates. Maximal degree in co-relation 200698. Up to 9866 conditions per place. [2022-12-13 05:36:38,996 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 3703 selfloop transitions, 1494 changer transitions 243/5440 dead transitions. [2022-12-13 05:36:38,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 5440 transitions, 348631 flow [2022-12-13 05:36:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 05:36:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 05:36:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 173 transitions. [2022-12-13 05:36:38,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2426367461430575 [2022-12-13 05:36:38,999 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 329 predicate places. [2022-12-13 05:36:38,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 5440 transitions, 348631 flow [2022-12-13 05:36:39,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 348 places, 5197 transitions, 332969 flow [2022-12-13 05:36:39,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:36:39,381 INFO L89 Accepts]: Start accepts. Operand has 348 places, 5197 transitions, 332969 flow [2022-12-13 05:36:39,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:36:39,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:39,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 348 places, 5197 transitions, 332969 flow [2022-12-13 05:36:39,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 348 places, 5197 transitions, 332969 flow [2022-12-13 05:36:39,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:36:39,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:36:39,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347 [2022-12-13 05:36:39,728 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 5197 transitions, 332969 flow [2022-12-13 05:36:39,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:39,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:36:39,728 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:36:39,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 05:36:39,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:36:39,933 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:36:39,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:36:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1823939966, now seen corresponding path program 4 times [2022-12-13 05:36:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:36:39,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623617448] [2022-12-13 05:36:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:36:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:36:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:36:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:40,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:36:40,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623617448] [2022-12-13 05:36:40,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623617448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:36:40,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118430456] [2022-12-13 05:36:40,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:36:40,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:36:40,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:36:40,076 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:36:40,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 05:36:40,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:36:40,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:36:40,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 05:36:40,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:36:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:40,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:36:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:36:40,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118430456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:36:40,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:36:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-12-13 05:36:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527825816] [2022-12-13 05:36:40,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:36:40,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 05:36:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:36:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 05:36:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-13 05:36:40,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:36:40,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 5197 transitions, 332969 flow. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:36:40,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:36:40,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:36:40,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:15,819 INFO L130 PetriNetUnfolder]: 6267/11060 cut-off events. [2022-12-13 05:37:15,820 INFO L131 PetriNetUnfolder]: For 141127/141127 co-relation queries the response was YES. [2022-12-13 05:37:15,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360322 conditions, 11060 events. 6267/11060 cut-off events. For 141127/141127 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 79236 event pairs, 4 based on Foata normal form. 0/8699 useless extension candidates. Maximal degree in co-relation 238356. Up to 10851 conditions per place. [2022-12-13 05:37:15,940 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 4459 selfloop transitions, 1649 changer transitions 0/6108 dead transitions. [2022-12-13 05:37:15,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 05:37:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-13 05:37:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 262 transitions. [2022-12-13 05:37:15,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22335890878090367 [2022-12-13 05:37:15,943 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 376 predicate places. [2022-12-13 05:37:15,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:16,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:16,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:16,347 INFO L89 Accepts]: Start accepts. Operand has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:16,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:16,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:16,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:16,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:16,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:16,739 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:16,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-13 05:37:16,740 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 6108 transitions, 403449 flow [2022-12-13 05:37:16,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:16,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:16,740 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:16,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 05:37:16,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:16,945 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash -615389888, now seen corresponding path program 5 times [2022-12-13 05:37:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:16,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535367439] [2022-12-13 05:37:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:17,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535367439] [2022-12-13 05:37:17,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535367439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:37:17,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147308039] [2022-12-13 05:37:17,242 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 05:37:17,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:17,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:37:17,243 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:37:17,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 05:37:17,438 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 05:37:17,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:37:17,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 05:37:17,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:37:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:17,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:37:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:17,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147308039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:37:17,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:37:17,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 05:37:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71275986] [2022-12-13 05:37:17,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:37:17,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 05:37:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 05:37:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-12-13 05:37:17,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:37:17,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 6108 transitions, 403449 flow. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:17,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:17,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:37:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:38:06,047 INFO L130 PetriNetUnfolder]: 6654/12539 cut-off events. [2022-12-13 05:38:06,048 INFO L131 PetriNetUnfolder]: For 141327/141327 co-relation queries the response was YES. [2022-12-13 05:38:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421799 conditions, 12539 events. 6654/12539 cut-off events. For 141327/141327 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 99750 event pairs, 4 based on Foata normal form. 26/10074 useless extension candidates. Maximal degree in co-relation 277744. Up to 12330 conditions per place. [2022-12-13 05:38:06,184 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 4487 selfloop transitions, 2646 changer transitions 26/7159 dead transitions. [2022-12-13 05:38:06,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 7159 transitions, 487547 flow [2022-12-13 05:38:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 05:38:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-13 05:38:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 265 transitions. [2022-12-13 05:38:06,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19528371407516582 [2022-12-13 05:38:06,185 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 434 predicate places. [2022-12-13 05:38:06,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 455 places, 7159 transitions, 487547 flow [2022-12-13 05:38:06,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 454 places, 7133 transitions, 485764 flow [2022-12-13 05:38:06,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:38:06,597 INFO L89 Accepts]: Start accepts. Operand has 454 places, 7133 transitions, 485764 flow [2022-12-13 05:38:06,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:38:06,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:38:06,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 7133 transitions, 485764 flow [2022-12-13 05:38:07,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 7133 transitions, 485764 flow [2022-12-13 05:38:07,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:38:07,221 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:38:07,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 625 [2022-12-13 05:38:07,222 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 7133 transitions, 485764 flow [2022-12-13 05:38:07,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:38:07,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:38:07,222 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:38:07,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 05:38:07,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:38:07,424 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:38:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:38:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 546918352, now seen corresponding path program 6 times [2022-12-13 05:38:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:38:07,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207976640] [2022-12-13 05:38:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:38:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:38:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:38:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:38:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:38:07,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207976640] [2022-12-13 05:38:07,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207976640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:38:07,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923930062] [2022-12-13 05:38:07,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 05:38:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:38:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:38:07,618 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:38:07,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 05:38:07,733 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 05:38:07,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:38:07,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 05:38:07,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:38:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:38:07,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:38:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:38:07,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923930062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:38:07,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:38:07,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 05:38:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239286094] [2022-12-13 05:38:07,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:38:07,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 05:38:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:38:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 05:38:07,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-12-13 05:38:07,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:38:07,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 7133 transitions, 485764 flow. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:38:07,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:38:07,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:38:07,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:39:22,343 INFO L130 PetriNetUnfolder]: 7504/14136 cut-off events. [2022-12-13 05:39:22,343 INFO L131 PetriNetUnfolder]: For 142040/142040 co-relation queries the response was YES. [2022-12-13 05:39:22,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489975 conditions, 14136 events. 7504/14136 cut-off events. For 142040/142040 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 114212 event pairs, 4 based on Foata normal form. 35/11380 useless extension candidates. Maximal degree in co-relation 318181. Up to 13915 conditions per place. [2022-12-13 05:39:22,485 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 5505 selfloop transitions, 2612 changer transitions 41/8158 dead transitions. [2022-12-13 05:39:22,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 8158 transitions, 571850 flow [2022-12-13 05:39:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-13 05:39:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-13 05:39:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 277 transitions. [2022-12-13 05:39:22,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17975340687865024 [2022-12-13 05:39:22,487 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 499 predicate places. [2022-12-13 05:39:22,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 520 places, 8158 transitions, 571850 flow [2022-12-13 05:39:22,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 518 places, 8117 transitions, 568959 flow [2022-12-13 05:39:22,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:39:22,929 INFO L89 Accepts]: Start accepts. Operand has 518 places, 8117 transitions, 568959 flow [2022-12-13 05:39:23,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:39:23,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:39:23,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 518 places, 8117 transitions, 568959 flow [2022-12-13 05:39:23,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 518 places, 8117 transitions, 568959 flow [2022-12-13 05:39:23,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:39:23,688 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:39:23,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 761 [2022-12-13 05:39:23,689 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 8117 transitions, 568959 flow [2022-12-13 05:39:23,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:39:23,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:39:23,689 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:39:23,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 05:39:23,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 05:39:23,894 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:39:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:39:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2076231872, now seen corresponding path program 7 times [2022-12-13 05:39:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:39:23,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905127557] [2022-12-13 05:39:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:39:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:39:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:39:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:39:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:39:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905127557] [2022-12-13 05:39:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905127557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:39:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404152679] [2022-12-13 05:39:24,052 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 05:39:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:39:24,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:39:24,053 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:39:24,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 05:39:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:39:24,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 05:39:24,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:39:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:39:24,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:39:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:39:24,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404152679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:39:24,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:39:24,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 05:39:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852830697] [2022-12-13 05:39:24,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:39:24,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 05:39:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:39:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 05:39:24,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-12-13 05:39:24,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 05:39:24,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 8117 transitions, 568959 flow. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:39:24,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:39:24,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 05:39:24,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:39:37,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 05:41:19,320 INFO L130 PetriNetUnfolder]: 9030/16945 cut-off events. [2022-12-13 05:41:19,320 INFO L131 PetriNetUnfolder]: For 142205/142205 co-relation queries the response was YES. [2022-12-13 05:41:19,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605151 conditions, 16945 events. 9030/16945 cut-off events. For 142205/142205 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 140323 event pairs, 4 based on Foata normal form. 12/13596 useless extension candidates. Maximal degree in co-relation 387624. Up to 16716 conditions per place. [2022-12-13 05:41:19,491 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 6667 selfloop transitions, 3193 changer transitions 19/9879 dead transitions. [2022-12-13 05:41:19,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 9879 transitions, 712343 flow [2022-12-13 05:41:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 05:41:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-13 05:41:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 268 transitions. [2022-12-13 05:41:19,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17654808959156784 [2022-12-13 05:41:19,493 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 561 predicate places. [2022-12-13 05:41:19,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 582 places, 9879 transitions, 712343 flow [2022-12-13 05:41:19,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 578 places, 9860 transitions, 710969 flow [2022-12-13 05:41:20,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:41:20,126 INFO L89 Accepts]: Start accepts. Operand has 578 places, 9860 transitions, 710969 flow [2022-12-13 05:41:20,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:41:20,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:41:20,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 578 places, 9860 transitions, 710969 flow [2022-12-13 05:41:20,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 578 places, 9860 transitions, 710969 flow [2022-12-13 05:41:20,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:41:20,888 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:41:20,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 766 [2022-12-13 05:41:20,892 INFO L495 AbstractCegarLoop]: Abstraction has has 578 places, 9860 transitions, 710969 flow [2022-12-13 05:41:20,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:41:20,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:41:20,893 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:41:20,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 05:41:21,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:41:21,098 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:41:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:41:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 264619993, now seen corresponding path program 1 times [2022-12-13 05:41:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:41:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126517098] [2022-12-13 05:41:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:41:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:41:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:41:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:41:26,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:41:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126517098] [2022-12-13 05:41:26,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126517098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:41:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945148913] [2022-12-13 05:41:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:41:26,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:41:26,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:41:26,720 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:41:26,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 05:41:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:41:26,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 05:41:26,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:41:26,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:41:26,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 05:41:27,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:41:27,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:41:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:41:27,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:41:27,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:41:27,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 05:41:27,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:41:27,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 05:41:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:41:32,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945148913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:41:32,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:41:32,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 05:41:32,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877909567] [2022-12-13 05:41:32,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:41:32,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 05:41:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:41:32,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 05:41:32,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-12-13 05:41:32,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:41:32,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 9860 transitions, 710969 flow. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:41:32,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:41:32,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:41:32,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:43:31,046 INFO L130 PetriNetUnfolder]: 9808/18498 cut-off events. [2022-12-13 05:43:31,047 INFO L131 PetriNetUnfolder]: For 172824/172824 co-relation queries the response was YES. [2022-12-13 05:43:31,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678570 conditions, 18498 events. 9808/18498 cut-off events. For 172824/172824 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 156139 event pairs, 4 based on Foata normal form. 4/14842 useless extension candidates. Maximal degree in co-relation 419012. Up to 18253 conditions per place. [2022-12-13 05:43:31,238 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 9949 selfloop transitions, 733 changer transitions 50/10755 dead transitions. [2022-12-13 05:43:31,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 10755 transitions, 797167 flow [2022-12-13 05:43:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 05:43:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 05:43:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 166 transitions. [2022-12-13 05:43:31,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42455242966751916 [2022-12-13 05:43:31,239 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 573 predicate places. [2022-12-13 05:43:31,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 594 places, 10755 transitions, 797167 flow [2022-12-13 05:43:31,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 594 places, 10705 transitions, 793419 flow [2022-12-13 05:43:31,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:43:31,939 INFO L89 Accepts]: Start accepts. Operand has 594 places, 10705 transitions, 793419 flow [2022-12-13 05:43:32,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:43:32,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:43:32,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 594 places, 10705 transitions, 793419 flow [2022-12-13 05:43:32,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 594 places, 10705 transitions, 793419 flow [2022-12-13 05:43:32,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:43:32,702 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:43:32,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 766 [2022-12-13 05:43:32,705 INFO L495 AbstractCegarLoop]: Abstraction has has 594 places, 10705 transitions, 793419 flow [2022-12-13 05:43:32,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:43:32,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:43:32,706 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:43:32,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 05:43:32,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:43:32,911 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:43:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:43:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1296314277, now seen corresponding path program 2 times [2022-12-13 05:43:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:43:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63217925] [2022-12-13 05:43:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:43:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:43:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:43:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:43:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:43:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63217925] [2022-12-13 05:43:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63217925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:43:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747126966] [2022-12-13 05:43:53,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:43:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:43:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:43:53,119 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:43:53,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 05:43:53,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:43:53,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:43:53,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 05:43:53,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:43:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 05:43:53,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 05:43:53,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:43:53,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-13 05:43:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:43:53,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:43:53,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:43:53,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-13 05:43:53,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 05:43:53,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-13 05:43:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:43:58,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747126966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:43:58,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:43:58,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 05:43:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245624203] [2022-12-13 05:43:58,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:43:58,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 05:43:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:43:58,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 05:43:58,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-12-13 05:43:58,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-13 05:43:58,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 10705 transitions, 793419 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:43:58,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:43:58,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-13 05:43:58,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 05:45:06,874 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:45:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 05:45:06,875 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:45:06,875 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 05:45:06,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 05:45:07,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 05:45:07,081 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 2/23 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 370370 conditions, 9910 events (5516/9909 cut-off events. For 170866/170866 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 83018 event pairs, 3 based on Foata normal form. 0/8818 useless extension candidates. Maximal degree in co-relation 216302. Up to 9671 conditions per place.). [2022-12-13 05:45:07,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 05:45:07,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 05:45:07,082 INFO L445 BasicCegarLoop]: Path program histogram: [13, 7, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-12-13 05:45:07,084 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:45:07,084 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:45:07,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:45:07 BasicIcfg [2022-12-13 05:45:07,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:45:07,087 INFO L158 Benchmark]: Toolchain (without parser) took 837355.26ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 144.5MB in the beginning and 590.8MB in the end (delta: -446.3MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-13 05:45:07,087 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:45:07,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.89ms. Allocated memory is still 167.8MB. Free memory was 144.5MB in the beginning and 133.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 05:45:07,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.81ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:45:07,091 INFO L158 Benchmark]: Boogie Preprocessor took 33.63ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 129.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 05:45:07,091 INFO L158 Benchmark]: RCFGBuilder took 492.87ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 112.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 05:45:07,091 INFO L158 Benchmark]: TraceAbstraction took 836524.20ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 110.9MB in the beginning and 590.8MB in the end (delta: -479.8MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-13 05:45:07,093 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.12ms. Allocated memory is still 167.8MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.89ms. Allocated memory is still 167.8MB. Free memory was 144.5MB in the beginning and 133.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.81ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.63ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 129.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 492.87ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 112.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 836524.20ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 110.9MB in the beginning and 590.8MB in the end (delta: -479.8MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 161 PlacesBefore, 21 PlacesAfterwards, 170 TransitionsBefore, 17 TransitionsAfterwards, 3242 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 71 ConcurrentYvCompositions, 13 ChoiceCompositions, 153 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 2091, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1903, independent: 1901, independent conditional: 0, independent unconditional: 1901, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1903, independent: 1901, independent conditional: 0, independent unconditional: 1901, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2093, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1903, unknown conditional: 0, unknown unconditional: 1903] , Statistics on independence cache: Total cache size (in pairs): 3766, Positive cache size: 3764, Positive conditional cache size: 0, Positive unconditional cache size: 3764, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.7s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 50 PlacesBefore, 47 PlacesAfterwards, 81 TransitionsBefore, 78 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 66 PlacesBefore, 65 PlacesAfterwards, 150 TransitionsBefore, 149 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 435 TransitionsBefore, 435 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 728 TransitionsBefore, 728 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 122 PlacesBefore, 122 PlacesAfterwards, 1156 TransitionsBefore, 1156 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 1587 TransitionsBefore, 1587 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 151 PlacesBefore, 151 PlacesAfterwards, 1817 TransitionsBefore, 1817 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 171 PlacesBefore, 171 PlacesAfterwards, 1963 TransitionsBefore, 1963 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 187 PlacesBefore, 187 PlacesAfterwards, 2191 TransitionsBefore, 2191 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 205 PlacesBefore, 205 PlacesAfterwards, 2779 TransitionsBefore, 2779 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 223 PlacesBefore, 223 PlacesAfterwards, 2910 TransitionsBefore, 2910 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 241 PlacesBefore, 240 PlacesAfterwards, 2989 TransitionsBefore, 2988 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 262 PlacesBefore, 259 PlacesAfterwards, 3311 TransitionsBefore, 3308 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 281 PlacesBefore, 281 PlacesAfterwards, 3630 TransitionsBefore, 3630 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 291 PlacesBefore, 291 PlacesAfterwards, 3676 TransitionsBefore, 3676 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 301 PlacesBefore, 301 PlacesAfterwards, 3737 TransitionsBefore, 3737 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 307 PlacesBefore, 307 PlacesAfterwards, 3754 TransitionsBefore, 3754 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 313 PlacesBefore, 313 PlacesAfterwards, 3782 TransitionsBefore, 3782 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 320 PlacesBefore, 320 PlacesAfterwards, 3801 TransitionsBefore, 3801 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 348 PlacesBefore, 348 PlacesAfterwards, 5197 TransitionsBefore, 5197 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 397 PlacesBefore, 397 PlacesAfterwards, 6108 TransitionsBefore, 6108 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 454 PlacesBefore, 454 PlacesAfterwards, 7133 TransitionsBefore, 7133 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 518 PlacesBefore, 518 PlacesAfterwards, 8117 TransitionsBefore, 8117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 578 PlacesBefore, 578 PlacesAfterwards, 9860 TransitionsBefore, 9860 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 594 PlacesBefore, 594 PlacesAfterwards, 10705 TransitionsBefore, 10705 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 2/23 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 370370 conditions, 9910 events (5516/9909 cut-off events. For 170866/170866 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 83018 event pairs, 3 based on Foata normal form. 0/8818 useless extension candidates. Maximal degree in co-relation 216302. Up to 9671 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 2/23 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 370370 conditions, 9910 events (5516/9909 cut-off events. For 170866/170866 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 83018 event pairs, 3 based on Foata normal form. 0/8818 useless extension candidates. Maximal degree in co-relation 216302. Up to 9671 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 2/23 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 370370 conditions, 9910 events (5516/9909 cut-off events. For 170866/170866 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 83018 event pairs, 3 based on Foata normal form. 0/8818 useless extension candidates. Maximal degree in co-relation 216302. Up to 9671 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 237 locations, 3 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: 836.3s, OverallIterations: 37, TraceHistogramMax: 4, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 649.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 243 mSolverCounterUnknown, 3212 SdHoareTripleChecker+Valid, 55.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3212 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 52.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 290 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17950 IncrementalHoareTripleChecker+Invalid, 19400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 917 mSolverCounterUnsat, 52 mSDtfsCounter, 17950 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1652 GetRequests, 752 SyntacticMatches, 30 SemanticMatches, 870 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 8388 ImplicationChecksByTransitivity, 78.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793419occurred in iteration=36, InterpolantAutomatonStates: 658, 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.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 148.3s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 1575 ConstructedInterpolants, 58 QuantifiedInterpolants, 60320 SizeOfPredicates, 311 NumberOfNonLiveVariables, 6638 ConjunctsInSsa, 876 ConjunctsInUnsatCore, 100 InterpolantComputations, 8 PerfectInterpolantSequences, 47/743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown