/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:15:22,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:15:22,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:15:22,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:15:22,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:15:22,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:15:22,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:15:22,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:15:22,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:15:22,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:15:22,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:15:22,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:15:22,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:15:22,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:15:22,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:15:22,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:15:22,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:15:22,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:15:22,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:15:22,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:15:22,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:15:22,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:15:22,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:15:22,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:15:22,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:15:22,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:15:22,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:15:22,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:15:22,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:15:22,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:15:22,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:15:22,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:15:22,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:15:22,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:15:22,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:15:22,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:15:22,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:15:22,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:15:22,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:15:22,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:15:22,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:15:22,998 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:15:23,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:15:23,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:15:23,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:15:23,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:15:23,040 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:15:23,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:15:23,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:15:23,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:15:23,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:15:23,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:15:23,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:15:23,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:15:23,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:15:23,043 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:15:23,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:15:23,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:15:23,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:15:23,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:15:23,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:15:23,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:15:23,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:15:23,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:23,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:15:23,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:15:23,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:15:23,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:15:23,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:15:23,045 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:15:23,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:15:23,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:15:23,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:15:23,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:15:23,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:15:23,507 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:15:23,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-12-06 06:15:24,746 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:15:25,015 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:15:25,017 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-12-06 06:15:25,033 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de746ec83/7f38ba427cc64a7e913ac33ef9bf83f5/FLAG95838f907 [2022-12-06 06:15:25,044 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de746ec83/7f38ba427cc64a7e913ac33ef9bf83f5 [2022-12-06 06:15:25,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:15:25,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:15:25,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:25,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:15:25,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:15:25,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:25,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb0e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25, skipping insertion in model container [2022-12-06 06:15:25,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:25,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:15:25,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:15:25,734 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-12-06 06:15:25,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:25,796 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:15:25,841 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-12-06 06:15:25,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:25,919 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:15:25,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25 WrapperNode [2022-12-06 06:15:25,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:25,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:25,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:15:25,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:15:25,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:25,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:25,997 INFO L138 Inliner]: procedures = 277, calls = 43, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 152 [2022-12-06 06:15:25,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:25,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:15:25,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:15:25,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:15:26,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,038 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:15:26,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:15:26,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:15:26,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:15:26,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (1/1) ... [2022-12-06 06:15:26,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:26,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:15:26,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:15:26,146 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:15:26,147 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:15:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:15:26,148 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:15:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:15:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:15:26,151 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:15:26,365 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:15:26,367 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:15:26,608 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:15:26,620 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:15:26,620 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:15:26,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:26 BoogieIcfgContainer [2022-12-06 06:15:26,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:15:26,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:15:26,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:15:26,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:15:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:15:25" (1/3) ... [2022-12-06 06:15:26,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c50a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:26, skipping insertion in model container [2022-12-06 06:15:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:25" (2/3) ... [2022-12-06 06:15:26,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c50a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:26, skipping insertion in model container [2022-12-06 06:15:26,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:26" (3/3) ... [2022-12-06 06:15:26,645 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-12-06 06:15:26,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:15:26,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:15:26,676 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:15:26,784 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:15:26,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 154 transitions, 324 flow [2022-12-06 06:15:26,886 INFO L130 PetriNetUnfolder]: 10/152 cut-off events. [2022-12-06 06:15:26,886 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:15:26,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 10/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-06 06:15:26,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 154 transitions, 324 flow [2022-12-06 06:15:26,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 143 transitions, 295 flow [2022-12-06 06:15:26,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:26,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-06 06:15:26,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 143 transitions, 295 flow [2022-12-06 06:15:26,997 INFO L130 PetriNetUnfolder]: 10/143 cut-off events. [2022-12-06 06:15:26,997 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:26,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 143 events. 10/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 310 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-06 06:15:27,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-06 06:15:27,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-06 06:15:31,435 INFO L203 LiptonReduction]: Total number of compositions: 114 [2022-12-06 06:15:31,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:15:31,452 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;@76904889, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:15:31,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:15:31,455 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2022-12-06 06:15:31,456 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:31,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:31,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:15:31,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1180676574, now seen corresponding path program 1 times [2022-12-06 06:15:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:31,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076235225] [2022-12-06 06:15:31,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076235225] [2022-12-06 06:15:31,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076235225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:31,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:31,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359224982] [2022-12-06 06:15:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:31,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:31,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 06:15:31,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-06 06:15:31,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:31,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 06:15:31,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:31,865 INFO L130 PetriNetUnfolder]: 828/1392 cut-off events. [2022-12-06 06:15:31,866 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 06:15:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1392 events. 828/1392 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5779 event pairs, 371 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 2619. Up to 880 conditions per place. [2022-12-06 06:15:31,874 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-06 06:15:31,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-06 06:15:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 06:15:31,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 06:15:31,885 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-06 06:15:31,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-06 06:15:31,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:31,889 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:31,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-06 06:15:31,893 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 06:15:31,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:31,893 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:31,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:31,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:31,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:31,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:31,902 INFO L130 PetriNetUnfolder]: 9/66 cut-off events. [2022-12-06 06:15:31,902 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:15:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 66 events. 9/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 73. Up to 9 conditions per place. [2022-12-06 06:15:31,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:31,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 06:15:31,934 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:31,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 06:15:31,936 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-06 06:15:31,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-06 06:15:31,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:31,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:31,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:15:31,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:31,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1910694523, now seen corresponding path program 1 times [2022-12-06 06:15:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:31,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710597516] [2022-12-06 06:15:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:31,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710597516] [2022-12-06 06:15:31,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710597516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:31,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:31,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919926353] [2022-12-06 06:15:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:31,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:31,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 06:15:31,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:31,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:31,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 06:15:31,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:32,200 INFO L130 PetriNetUnfolder]: 1126/1960 cut-off events. [2022-12-06 06:15:32,201 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-06 06:15:32,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1960 events. 1126/1960 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10225 event pairs, 586 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 3693. Up to 1284 conditions per place. [2022-12-06 06:15:32,210 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 56 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-06 06:15:32,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 271 flow [2022-12-06 06:15:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-06 06:15:32,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2022-12-06 06:15:32,212 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 71 transitions. [2022-12-06 06:15:32,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 271 flow [2022-12-06 06:15:32,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:32,214 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:32,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-06 06:15:32,215 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 06:15:32,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:32,215 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:32,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:32,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:32,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:32,222 INFO L130 PetriNetUnfolder]: 12/97 cut-off events. [2022-12-06 06:15:32,222 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:15:32,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 97 events. 12/97 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 297 event pairs, 1 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 114. Up to 11 conditions per place. [2022-12-06 06:15:32,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:32,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-06 06:15:32,231 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:32,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:15:32,232 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-06 06:15:32,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:32,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:32,232 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:32,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:15:32,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash -297744408, now seen corresponding path program 1 times [2022-12-06 06:15:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:32,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491198401] [2022-12-06 06:15:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:32,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491198401] [2022-12-06 06:15:32,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491198401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:32,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234269942] [2022-12-06 06:15:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:32,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:32,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:32,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:32,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 06:15:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:32,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 06:15:32,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:32,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:32,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234269942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:32,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:32,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 06:15:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811574917] [2022-12-06 06:15:32,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:32,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:15:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:15:32,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:15:32,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 06:15:32,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:32,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:32,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 06:15:32,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:33,305 INFO L130 PetriNetUnfolder]: 2279/3969 cut-off events. [2022-12-06 06:15:33,305 INFO L131 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES. [2022-12-06 06:15:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 3969 events. 2279/3969 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 21862 event pairs, 454 based on Foata normal form. 96/3479 useless extension candidates. Maximal degree in co-relation 8059. Up to 1258 conditions per place. [2022-12-06 06:15:33,324 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-06 06:15:33,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-06 06:15:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:15:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:15:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-06 06:15:33,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 06:15:33,326 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-06 06:15:33,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-06 06:15:33,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:33,332 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:33,332 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-06 06:15:33,332 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 06:15:33,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:33,333 INFO L89 Accepts]: Start accepts. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:33,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:33,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:33,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:33,350 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L1008-1-->L974: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23| |v_~#arr~0.offset_37|) (= |v_~#arr~0.base_37| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|) (< 0 v_~top~0_87)) InVars {~#arr~0.offset=|v_~#arr~0.offset_37|, ~top~0=v_~top~0_87, ~#arr~0.base=|v_~#arr~0.base_37|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_37|, t2Thread1of1ForFork1_pop_#t~mem37#1=|v_t2Thread1of1ForFork1_pop_#t~mem37#1_31|, t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_37|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_23|, t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_13|, t2Thread1of1ForFork1_pop_#t~ret36#1=|v_t2Thread1of1ForFork1_pop_#t~ret36#1_35|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_37|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_15|, ~top~0=v_~top~0_87, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_23|, ~#arr~0.base=|v_~#arr~0.base_37|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_33|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_#t~mem37#1, t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_pop_#in~stack#1.offset, t2Thread1of1ForFork1_#t~nondet43#1, t2Thread1of1ForFork1_pop_#t~ret36#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#in~stack#1.base, t2Thread1of1ForFork1_pop_#res#1][38], [26#L1023-4true, Black: 164#(= ~top~0 0), 59#push_returnLabel#1true, Black: 170#true, Black: 255#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 1)), 107#L974true, Black: 229#(< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4), Black: 257#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)), Black: 259#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 0)), Black: 174#(<= ~top~0 1), Black: 178#(<= ~top~0 0), 219#(not (<= 5 ~top~0)), t2Thread1of1ForFork1InUse, 168#(= |t1Thread1of1ForFork0_push_#res#1| 0)]) [2022-12-06 06:15:33,351 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 06:15:33,351 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 06:15:33,351 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:15:33,351 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 06:15:33,351 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1][21], [26#L1023-4true, 59#push_returnLabel#1true, Black: 164#(= ~top~0 0), Black: 170#true, Black: 255#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 1)), Black: 229#(< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4), Black: 257#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)), Black: 259#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 0)), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), t2Thread1of1ForFork1InUse, 76#L1009-1true, 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), 178#(<= ~top~0 0)]) [2022-12-06 06:15:33,351 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 06:15:33,351 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 06:15:33,352 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 06:15:33,352 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 06:15:33,356 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1][21], [26#L1023-4true, Black: 164#(= ~top~0 0), Black: 170#true, Black: 255#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 1)), 104#L946-1true, Black: 229#(< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4), Black: 168#(= |t1Thread1of1ForFork0_push_#res#1| 0), Black: 257#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)), Black: 259#(and (< |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= ~top~0 0)), Black: 174#(<= ~top~0 1), Black: 219#(not (<= 5 ~top~0)), t2Thread1of1ForFork1InUse, 76#L1009-1true, 178#(<= ~top~0 0)]) [2022-12-06 06:15:33,356 INFO L382 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-06 06:15:33,356 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-06 06:15:33,356 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 06:15:33,356 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 06:15:33,358 INFO L130 PetriNetUnfolder]: 72/348 cut-off events. [2022-12-06 06:15:33,358 INFO L131 PetriNetUnfolder]: For 317/328 co-relation queries the response was YES. [2022-12-06 06:15:33,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 348 events. 72/348 cut-off events. For 317/328 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1910 event pairs, 2 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 683. Up to 47 conditions per place. [2022-12-06 06:15:33,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 65 transitions, 321 flow [2022-12-06 06:15:33,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-06 06:15:33,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L974-->L1011-3: Formula: (and (= v_~top~0_122 0) (= |v_t2Thread1of1ForFork1_pop_~stack#1.base_51| |v_t2Thread1of1ForFork1_pop_#in~stack#1.base_35|) (= |v_t2Thread1of1ForFork1_#t~ret44#1_49| |v_t2Thread1of1ForFork1_pop_#res#1_45|) (= |v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_35| |v_t2Thread1of1ForFork1_pop_~stack#1.offset_51|) (= (+ 2 |v_t2Thread1of1ForFork1_pop_#res#1_45|) 0)) InVars {t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_35|, ~top~0=v_~top~0_122, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_35|} OutVars{t2Thread1of1ForFork1_pop_~stack#1.base=|v_t2Thread1of1ForFork1_pop_~stack#1.base_51|, t2Thread1of1ForFork1_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork1_pop_#in~stack#1.offset_35|, t2Thread1of1ForFork1_#t~ret44#1=|v_t2Thread1of1ForFork1_#t~ret44#1_49|, t2Thread1of1ForFork1_pop_~stack#1.offset=|v_t2Thread1of1ForFork1_pop_~stack#1.offset_51|, t2Thread1of1ForFork1_pop_#t~nondet35#1=|v_t2Thread1of1ForFork1_pop_#t~nondet35#1_25|, ~top~0=v_~top~0_122, t2Thread1of1ForFork1_pop_#in~stack#1.base=|v_t2Thread1of1ForFork1_pop_#in~stack#1.base_35|, t2Thread1of1ForFork1_pop_#res#1=|v_t2Thread1of1ForFork1_pop_#res#1_45|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_pop_~stack#1.base, t2Thread1of1ForFork1_#t~ret44#1, t2Thread1of1ForFork1_pop_~stack#1.offset, t2Thread1of1ForFork1_pop_#t~nondet35#1, t2Thread1of1ForFork1_pop_#res#1] and [565] L946-1-->push_returnLabel#1: Formula: (and (= (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|) v_~top~0_85) (= |v_t1Thread1of1ForFork0_push_#res#1_35| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_35|, ~top~0=v_~top~0_85} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-06 06:15:33,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1] and [565] L946-1-->push_returnLabel#1: Formula: (and (= (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|) v_~top~0_85) (= |v_t1Thread1of1ForFork0_push_#res#1_35| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_35|, ~top~0=v_~top~0_85} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-06 06:15:33,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [569] L1008-1-->L1009-1: Formula: (not (< 0 v_~top~0_89)) InVars {~top~0=v_~top~0_89} OutVars{t2Thread1of1ForFork1_#t~nondet43#1=|v_t2Thread1of1ForFork1_#t~nondet43#1_15|, ~top~0=v_~top~0_89} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet43#1] [2022-12-06 06:15:33,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [500] L950-1-->L948: Formula: (= (+ v_~top~0_28 1) |v_t2Thread1of1ForFork1_dec_top_#t~post32#1_16|) InVars {t2Thread1of1ForFork1_dec_top_#t~post32#1=|v_t2Thread1of1ForFork1_dec_top_#t~post32#1_16|} OutVars{~top~0=v_~top~0_28} AuxVars[] AssignedVars[~top~0, t2Thread1of1ForFork1_dec_top_#t~post32#1] [2022-12-06 06:15:33,507 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:15:33,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 06:15:33,509 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 352 flow [2022-12-06 06:15:33,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:33,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:33,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:33,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:33,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:33,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 52590737, now seen corresponding path program 1 times [2022-12-06 06:15:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:33,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455457893] [2022-12-06 06:15:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:33,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:33,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455457893] [2022-12-06 06:15:33,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455457893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:33,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:33,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:33,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44877438] [2022-12-06 06:15:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:33,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:15:33,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:33,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:15:33,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:15:33,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-06 06:15:33,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 352 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:33,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:33,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-06 06:15:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:34,055 INFO L130 PetriNetUnfolder]: 1959/3540 cut-off events. [2022-12-06 06:15:34,055 INFO L131 PetriNetUnfolder]: For 3338/3356 co-relation queries the response was YES. [2022-12-06 06:15:34,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8912 conditions, 3540 events. 1959/3540 cut-off events. For 3338/3356 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 20606 event pairs, 1461 based on Foata normal form. 20/3014 useless extension candidates. Maximal degree in co-relation 8332. Up to 3235 conditions per place. [2022-12-06 06:15:34,075 INFO L137 encePairwiseOnDemand]: 44/46 looper letters, 56 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2022-12-06 06:15:34,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 429 flow [2022-12-06 06:15:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:15:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:15:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-12-06 06:15:34,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5543478260869565 [2022-12-06 06:15:34,077 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 352 flow. Second operand 2 states and 51 transitions. [2022-12-06 06:15:34,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 429 flow [2022-12-06 06:15:34,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 408 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:34,092 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 296 flow [2022-12-06 06:15:34,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=296, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2022-12-06 06:15:34,093 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-06 06:15:34,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:34,093 INFO L89 Accepts]: Start accepts. Operand has 57 places, 61 transitions, 296 flow [2022-12-06 06:15:34,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:34,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:34,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 296 flow [2022-12-06 06:15:34,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 61 transitions, 296 flow [2022-12-06 06:15:34,116 INFO L130 PetriNetUnfolder]: 60/333 cut-off events. [2022-12-06 06:15:34,117 INFO L131 PetriNetUnfolder]: For 268/280 co-relation queries the response was YES. [2022-12-06 06:15:34,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 333 events. 60/333 cut-off events. For 268/280 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1837 event pairs, 2 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 618. Up to 41 conditions per place. [2022-12-06 06:15:34,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 61 transitions, 296 flow [2022-12-06 06:15:34,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-06 06:15:34,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:34,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 06:15:34,146 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 296 flow [2022-12-06 06:15:34,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:34,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:34,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:34,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:15:34,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash -386384014, now seen corresponding path program 1 times [2022-12-06 06:15:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:34,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834289404] [2022-12-06 06:15:34,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:34,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834289404] [2022-12-06 06:15:34,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834289404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:34,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:34,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532617974] [2022-12-06 06:15:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:34,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:34,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2022-12-06 06:15:34,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-06 06:15:34,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:34,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2022-12-06 06:15:34,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:34,458 INFO L130 PetriNetUnfolder]: 758/1527 cut-off events. [2022-12-06 06:15:34,458 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 06:15:34,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1527 events. 758/1527 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7647 event pairs, 138 based on Foata normal form. 68/1421 useless extension candidates. Maximal degree in co-relation 3339. Up to 1054 conditions per place. [2022-12-06 06:15:34,464 INFO L137 encePairwiseOnDemand]: 38/44 looper letters, 46 selfloop transitions, 6 changer transitions 4/61 dead transitions. [2022-12-06 06:15:34,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 349 flow [2022-12-06 06:15:34,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-06 06:15:34,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-06 06:15:34,465 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 296 flow. Second operand 3 states and 62 transitions. [2022-12-06 06:15:34,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 349 flow [2022-12-06 06:15:34,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 342 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:34,469 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 210 flow [2022-12-06 06:15:34,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-06 06:15:34,470 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2022-12-06 06:15:34,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:34,470 INFO L89 Accepts]: Start accepts. Operand has 53 places, 48 transitions, 210 flow [2022-12-06 06:15:34,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:34,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:34,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 210 flow [2022-12-06 06:15:34,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 210 flow [2022-12-06 06:15:34,482 INFO L130 PetriNetUnfolder]: 23/184 cut-off events. [2022-12-06 06:15:34,482 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 06:15:34,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 184 events. 23/184 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 761 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 326. Up to 26 conditions per place. [2022-12-06 06:15:34,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 210 flow [2022-12-06 06:15:34,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 06:15:35,151 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 06:15:35,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 682 [2022-12-06 06:15:35,152 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 220 flow [2022-12-06 06:15:35,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-06 06:15:35,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:35,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:35,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:15:35,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -135824068, now seen corresponding path program 1 times [2022-12-06 06:15:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795857829] [2022-12-06 06:15:35,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:35,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:35,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:35,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795857829] [2022-12-06 06:15:35,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795857829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:35,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:35,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:15:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15620414] [2022-12-06 06:15:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:35,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:15:35,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:35,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:15:35,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:15:35,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 06:15:35,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:35,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:35,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 06:15:35,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:36,135 INFO L130 PetriNetUnfolder]: 735/1458 cut-off events. [2022-12-06 06:15:36,135 INFO L131 PetriNetUnfolder]: For 1060/1060 co-relation queries the response was YES. [2022-12-06 06:15:36,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 1458 events. 735/1458 cut-off events. For 1060/1060 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7720 event pairs, 215 based on Foata normal form. 50/1508 useless extension candidates. Maximal degree in co-relation 2292. Up to 885 conditions per place. [2022-12-06 06:15:36,157 INFO L137 encePairwiseOnDemand]: 21/38 looper letters, 72 selfloop transitions, 19 changer transitions 12/106 dead transitions. [2022-12-06 06:15:36,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 106 transitions, 658 flow [2022-12-06 06:15:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:15:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:15:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-12-06 06:15:36,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2022-12-06 06:15:36,159 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 220 flow. Second operand 9 states and 132 transitions. [2022-12-06 06:15:36,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 106 transitions, 658 flow [2022-12-06 06:15:36,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 106 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:36,171 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 403 flow [2022-12-06 06:15:36,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2022-12-06 06:15:36,173 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 06:15:36,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:36,173 INFO L89 Accepts]: Start accepts. Operand has 56 places, 59 transitions, 403 flow [2022-12-06 06:15:36,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:36,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:36,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 59 transitions, 403 flow [2022-12-06 06:15:36,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 59 transitions, 403 flow [2022-12-06 06:15:36,218 INFO L130 PetriNetUnfolder]: 34/244 cut-off events. [2022-12-06 06:15:36,218 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-12-06 06:15:36,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 244 events. 34/244 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1287 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 328. Up to 32 conditions per place. [2022-12-06 06:15:36,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 59 transitions, 403 flow [2022-12-06 06:15:36,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 06:15:36,930 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:15:36,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 758 [2022-12-06 06:15:36,931 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 399 flow [2022-12-06 06:15:36,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:36,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:36,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:36,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:15:36,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 517701343, now seen corresponding path program 1 times [2022-12-06 06:15:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423883884] [2022-12-06 06:15:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:37,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423883884] [2022-12-06 06:15:37,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423883884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:37,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:37,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:15:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641988490] [2022-12-06 06:15:37,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:37,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:15:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:15:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:15:37,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:15:37,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 399 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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-06 06:15:37,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:37,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:15:37,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:37,866 INFO L130 PetriNetUnfolder]: 783/1577 cut-off events. [2022-12-06 06:15:37,867 INFO L131 PetriNetUnfolder]: For 2396/2396 co-relation queries the response was YES. [2022-12-06 06:15:37,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1577 events. 783/1577 cut-off events. For 2396/2396 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8794 event pairs, 231 based on Foata normal form. 16/1581 useless extension candidates. Maximal degree in co-relation 3122. Up to 905 conditions per place. [2022-12-06 06:15:37,875 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 73 selfloop transitions, 14 changer transitions 12/102 dead transitions. [2022-12-06 06:15:37,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 102 transitions, 770 flow [2022-12-06 06:15:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:15:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:15:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-06 06:15:37,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2022-12-06 06:15:37,876 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 399 flow. Second operand 8 states and 116 transitions. [2022-12-06 06:15:37,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 102 transitions, 770 flow [2022-12-06 06:15:37,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 728 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:37,882 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 448 flow [2022-12-06 06:15:37,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=448, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-12-06 06:15:37,883 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-12-06 06:15:37,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:37,883 INFO L89 Accepts]: Start accepts. Operand has 62 places, 60 transitions, 448 flow [2022-12-06 06:15:37,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:37,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:37,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 60 transitions, 448 flow [2022-12-06 06:15:37,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 448 flow [2022-12-06 06:15:37,900 INFO L130 PetriNetUnfolder]: 36/244 cut-off events. [2022-12-06 06:15:37,901 INFO L131 PetriNetUnfolder]: For 434/436 co-relation queries the response was YES. [2022-12-06 06:15:37,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 244 events. 36/244 cut-off events. For 434/436 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1284 event pairs, 0 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 501. Up to 38 conditions per place. [2022-12-06 06:15:37,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 448 flow [2022-12-06 06:15:37,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 06:15:38,304 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:15:38,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 423 [2022-12-06 06:15:38,306 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 445 flow [2022-12-06 06:15:38,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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-06 06:15:38,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:38,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:38,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:15:38,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 74427463, now seen corresponding path program 2 times [2022-12-06 06:15:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415492218] [2022-12-06 06:15:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:38,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:38,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415492218] [2022-12-06 06:15:38,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415492218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:38,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:38,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:15:38,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584744481] [2022-12-06 06:15:38,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:38,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:15:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:15:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:15:38,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:15:38,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 445 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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-06 06:15:38,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:38,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:15:38,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:39,410 INFO L130 PetriNetUnfolder]: 907/1824 cut-off events. [2022-12-06 06:15:39,411 INFO L131 PetriNetUnfolder]: For 3254/3254 co-relation queries the response was YES. [2022-12-06 06:15:39,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 1824 events. 907/1824 cut-off events. For 3254/3254 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10443 event pairs, 208 based on Foata normal form. 26/1838 useless extension candidates. Maximal degree in co-relation 3799. Up to 640 conditions per place. [2022-12-06 06:15:39,428 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 71 selfloop transitions, 26 changer transitions 12/112 dead transitions. [2022-12-06 06:15:39,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 112 transitions, 884 flow [2022-12-06 06:15:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:15:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:15:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-12-06 06:15:39,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2022-12-06 06:15:39,430 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 445 flow. Second operand 10 states and 130 transitions. [2022-12-06 06:15:39,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 112 transitions, 884 flow [2022-12-06 06:15:39,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 858 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:15:39,440 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 608 flow [2022-12-06 06:15:39,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2022-12-06 06:15:39,443 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2022-12-06 06:15:39,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:39,443 INFO L89 Accepts]: Start accepts. Operand has 71 places, 67 transitions, 608 flow [2022-12-06 06:15:39,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:39,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:39,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 67 transitions, 608 flow [2022-12-06 06:15:39,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 67 transitions, 608 flow [2022-12-06 06:15:39,473 INFO L130 PetriNetUnfolder]: 40/279 cut-off events. [2022-12-06 06:15:39,473 INFO L131 PetriNetUnfolder]: For 892/894 co-relation queries the response was YES. [2022-12-06 06:15:39,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 279 events. 40/279 cut-off events. For 892/894 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1583 event pairs, 0 based on Foata normal form. 2/233 useless extension candidates. Maximal degree in co-relation 677. Up to 45 conditions per place. [2022-12-06 06:15:39,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 67 transitions, 608 flow [2022-12-06 06:15:39,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 06:15:39,986 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:15:39,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 544 [2022-12-06 06:15:39,987 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 608 flow [2022-12-06 06:15:39,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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-06 06:15:39,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:39,988 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:39,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:15:39,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1755344352, now seen corresponding path program 1 times [2022-12-06 06:15:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:39,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953479799] [2022-12-06 06:15:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:40,778 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-06 06:15:40,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:40,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953479799] [2022-12-06 06:15:40,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953479799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:40,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731109376] [2022-12-06 06:15:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:40,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:40,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:40,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 06:15:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:40,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 06:15:40,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:41,152 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 22 treesize of output 17 [2022-12-06 06:15:41,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:15:43,416 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-06 06:15:43,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:43,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-06 06:15:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:15:43,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731109376] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:43,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 06:15:43,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 19 [2022-12-06 06:15:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273073584] [2022-12-06 06:15:43,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:43,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:43,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=329, Unknown=1, NotChecked=0, Total=380 [2022-12-06 06:15:43,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 39 [2022-12-06 06:15:43,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:43,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:43,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 39 [2022-12-06 06:15:43,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:44,110 INFO L130 PetriNetUnfolder]: 1194/2392 cut-off events. [2022-12-06 06:15:44,111 INFO L131 PetriNetUnfolder]: For 6439/6439 co-relation queries the response was YES. [2022-12-06 06:15:44,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7720 conditions, 2392 events. 1194/2392 cut-off events. For 6439/6439 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14763 event pairs, 414 based on Foata normal form. 0/2380 useless extension candidates. Maximal degree in co-relation 6710. Up to 923 conditions per place. [2022-12-06 06:15:44,123 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 81 selfloop transitions, 43 changer transitions 4/131 dead transitions. [2022-12-06 06:15:44,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 1223 flow [2022-12-06 06:15:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:15:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:15:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-06 06:15:44,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 06:15:44,125 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 608 flow. Second operand 8 states and 126 transitions. [2022-12-06 06:15:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 1223 flow [2022-12-06 06:15:44,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1161 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 06:15:44,139 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 864 flow [2022-12-06 06:15:44,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=864, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2022-12-06 06:15:44,140 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2022-12-06 06:15:44,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:44,140 INFO L89 Accepts]: Start accepts. Operand has 75 places, 84 transitions, 864 flow [2022-12-06 06:15:44,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:44,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:44,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 84 transitions, 864 flow [2022-12-06 06:15:44,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 864 flow [2022-12-06 06:15:44,169 INFO L130 PetriNetUnfolder]: 55/367 cut-off events. [2022-12-06 06:15:44,169 INFO L131 PetriNetUnfolder]: For 1419/1422 co-relation queries the response was YES. [2022-12-06 06:15:44,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 367 events. 55/367 cut-off events. For 1419/1422 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2384 event pairs, 0 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 964. Up to 56 conditions per place. [2022-12-06 06:15:44,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 84 transitions, 864 flow [2022-12-06 06:15:44,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 06:15:44,648 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:15:44,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 508 [2022-12-06 06:15:44,648 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 864 flow [2022-12-06 06:15:44,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:44,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:44,649 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:44,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 06:15:44,849 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,SelfDestructingSolverStorable8 [2022-12-06 06:15:44,849 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -628824304, now seen corresponding path program 2 times [2022-12-06 06:15:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:44,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773310106] [2022-12-06 06:15:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:45,427 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-06 06:15:45,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773310106] [2022-12-06 06:15:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773310106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810563100] [2022-12-06 06:15:45,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:15:45,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:45,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:15:45,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 06:15:45,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 06:15:45,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:15:45,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 06:15:45,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:45,532 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:15:45,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 06:15:45,678 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 22 treesize of output 17 [2022-12-06 06:15:45,796 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 63 treesize of output 58 [2022-12-06 06:15:45,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-06 06:15:48,265 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-06 06:15:48,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:48,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_255 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_255) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-06 06:15:48,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:15:48,403 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 06:15:48,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:15:48,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-06 06:15:48,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:15:48,496 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-06 06:15:48,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810563100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:48,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:48,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-06 06:15:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26534317] [2022-12-06 06:15:48,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:48,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 06:15:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 06:15:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=349, Unknown=3, NotChecked=38, Total=462 [2022-12-06 06:15:48,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 06:15:48,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 864 flow. Second operand has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:48,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:48,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 06:15:48,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:50,617 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 [0] [2022-12-06 06:15:53,651 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 [0] [2022-12-06 06:15:55,838 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 [0] [2022-12-06 06:15:57,880 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] [2022-12-06 06:16:01,985 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 [0] [2022-12-06 06:16:04,954 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 [0] [2022-12-06 06:16:08,473 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 [0] [2022-12-06 06:16:11,277 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 [0] [2022-12-06 06:16:13,301 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 [0] [2022-12-06 06:16:14,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:16,795 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] [2022-12-06 06:16:19,077 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 [0] [2022-12-06 06:16:21,119 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 [0, 1] [2022-12-06 06:16:23,219 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 [0, 1] [2022-12-06 06:16:25,336 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 [0] [2022-12-06 06:16:27,527 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 [0] [2022-12-06 06:16:29,569 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 [0] [2022-12-06 06:16:31,590 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 [0] [2022-12-06 06:16:33,644 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 [0, 1] [2022-12-06 06:16:35,668 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 [0] [2022-12-06 06:16:37,712 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 [0] [2022-12-06 06:16:39,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:41,823 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 [0] [2022-12-06 06:16:44,749 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 [0] [2022-12-06 06:16:46,938 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 [0] [2022-12-06 06:16:48,981 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] [2022-12-06 06:16:50,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 06:16:52,172 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 [0] [2022-12-06 06:16:54,198 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 [0] [2022-12-06 06:16:55,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:16:58,485 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 [0] [2022-12-06 06:17:00,504 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 [0] [2022-12-06 06:17:06,742 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 [0] [2022-12-06 06:17:08,777 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 [0] [2022-12-06 06:17:10,795 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 [0] [2022-12-06 06:17:12,884 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 [0] [2022-12-06 06:17:14,933 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 [0] [2022-12-06 06:17:16,963 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 [0] [2022-12-06 06:17:19,122 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 [0] [2022-12-06 06:17:21,161 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 [0] [2022-12-06 06:17:23,276 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 [0] [2022-12-06 06:17:25,352 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 [0] [2022-12-06 06:17:27,423 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 [0] [2022-12-06 06:17:29,454 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 [0] [2022-12-06 06:17:31,603 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 [0] [2022-12-06 06:17:33,856 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 [0] [2022-12-06 06:17:35,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:37,840 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 [0] [2022-12-06 06:17:39,877 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] [2022-12-06 06:17:41,928 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 [0] [2022-12-06 06:17:45,151 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 [0] [2022-12-06 06:17:47,648 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 [0] [2022-12-06 06:17:49,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:51,295 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 [0] [2022-12-06 06:17:52,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:53,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:17:56,381 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 [0] [2022-12-06 06:17:56,438 INFO L130 PetriNetUnfolder]: 1575/3209 cut-off events. [2022-12-06 06:17:56,439 INFO L131 PetriNetUnfolder]: For 12182/12182 co-relation queries the response was YES. [2022-12-06 06:17:56,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10589 conditions, 3209 events. 1575/3209 cut-off events. For 12182/12182 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 19742 event pairs, 321 based on Foata normal form. 78/3269 useless extension candidates. Maximal degree in co-relation 8858. Up to 704 conditions per place. [2022-12-06 06:17:56,459 INFO L137 encePairwiseOnDemand]: 11/41 looper letters, 129 selfloop transitions, 74 changer transitions 16/222 dead transitions. [2022-12-06 06:17:56,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 222 transitions, 2070 flow [2022-12-06 06:17:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:17:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:17:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2022-12-06 06:17:56,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33875338753387535 [2022-12-06 06:17:56,462 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 864 flow. Second operand 18 states and 250 transitions. [2022-12-06 06:17:56,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 222 transitions, 2070 flow [2022-12-06 06:17:56,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 222 transitions, 2008 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 06:17:56,482 INFO L231 Difference]: Finished difference. Result has 97 places, 114 transitions, 1419 flow [2022-12-06 06:17:56,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1419, PETRI_PLACES=97, PETRI_TRANSITIONS=114} [2022-12-06 06:17:56,484 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2022-12-06 06:17:56,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:56,484 INFO L89 Accepts]: Start accepts. Operand has 97 places, 114 transitions, 1419 flow [2022-12-06 06:17:56,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:56,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:56,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 114 transitions, 1419 flow [2022-12-06 06:17:56,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 114 transitions, 1419 flow [2022-12-06 06:17:56,572 INFO L130 PetriNetUnfolder]: 277/1018 cut-off events. [2022-12-06 06:17:56,573 INFO L131 PetriNetUnfolder]: For 4053/4061 co-relation queries the response was YES. [2022-12-06 06:17:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1018 events. 277/1018 cut-off events. For 4053/4061 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7411 event pairs, 133 based on Foata normal form. 5/917 useless extension candidates. Maximal degree in co-relation 2954. Up to 364 conditions per place. [2022-12-06 06:17:56,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 114 transitions, 1419 flow [2022-12-06 06:17:56,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-06 06:17:57,106 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:17:57,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 623 [2022-12-06 06:17:57,107 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 112 transitions, 1412 flow [2022-12-06 06:17:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:57,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:57,107 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:57,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 06:17:57,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:17:57,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1418912804, now seen corresponding path program 1 times [2022-12-06 06:17:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:57,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897501297] [2022-12-06 06:17:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:57,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:57,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897501297] [2022-12-06 06:17:57,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897501297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:17:57,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432491175] [2022-12-06 06:17:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:57,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:17:57,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:17:57,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:17:57,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 06:17:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:58,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 06:17:58,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:17:58,226 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 22 treesize of output 17 [2022-12-06 06:17:58,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:17:58,482 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 72 treesize of output 43 [2022-12-06 06:17:58,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-06 06:18:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:00,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:18:00,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-06 06:18:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:00,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432491175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:18:00,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:18:00,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 06:18:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640939290] [2022-12-06 06:18:00,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:18:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 06:18:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 06:18:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-12-06 06:18:00,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 43 [2022-12-06 06:18:00,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 112 transitions, 1412 flow. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:00,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:00,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 43 [2022-12-06 06:18:00,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:03,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:18:06,655 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 [0] [2022-12-06 06:18:09,271 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] [2022-12-06 06:18:11,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:18:14,364 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 [0] [2022-12-06 06:18:16,435 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 [0] [2022-12-06 06:18:17,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:18:19,933 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 [0] [2022-12-06 06:18:21,960 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 [0] [2022-12-06 06:18:24,044 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 [0] [2022-12-06 06:18:26,071 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 [0] [2022-12-06 06:18:28,105 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 [0] [2022-12-06 06:18:30,128 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 [0] [2022-12-06 06:18:32,179 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 [0] [2022-12-06 06:18:34,251 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] [2022-12-06 06:18:36,561 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] [2022-12-06 06:18:38,778 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 [0] [2022-12-06 06:18:40,824 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 [0] [2022-12-06 06:18:43,460 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 [0] [2022-12-06 06:18:45,537 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 [0] [2022-12-06 06:18:47,585 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 [0] [2022-12-06 06:18:49,620 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 [0] [2022-12-06 06:18:51,653 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] [2022-12-06 06:18:54,162 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 [0] [2022-12-06 06:18:56,274 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 [0] [2022-12-06 06:18:58,667 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 [0] [2022-12-06 06:19:00,696 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 [0] [2022-12-06 06:19:02,913 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 [0] [2022-12-06 06:19:06,262 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 [0] [2022-12-06 06:19:08,326 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 [0] [2022-12-06 06:19:10,457 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 [0] [2022-12-06 06:19:12,507 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 [0] [2022-12-06 06:19:14,715 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] [2022-12-06 06:19:16,802 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 [0] [2022-12-06 06:19:18,826 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 [0] [2022-12-06 06:19:21,016 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] [2022-12-06 06:19:23,056 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 [0] [2022-12-06 06:19:25,091 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 [0] [2022-12-06 06:19:28,169 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 [0] [2022-12-06 06:19:30,225 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] [2022-12-06 06:19:32,276 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 [0] [2022-12-06 06:19:34,303 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 [0] [2022-12-06 06:19:36,474 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 [0] [2022-12-06 06:19:38,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:19:40,427 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 [0] [2022-12-06 06:19:44,652 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 [0] [2022-12-06 06:19:47,202 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] [2022-12-06 06:19:49,290 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 [0] [2022-12-06 06:19:51,343 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] [2022-12-06 06:19:53,411 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 [0] [2022-12-06 06:19:55,699 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 [0] [2022-12-06 06:19:57,748 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 [0] [2022-12-06 06:19:59,795 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 [0] [2022-12-06 06:20:01,821 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 [0] [2022-12-06 06:20:03,874 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] [2022-12-06 06:20:05,939 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] [2022-12-06 06:20:07,975 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 [0] [2022-12-06 06:20:09,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:20:11,499 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] [2022-12-06 06:20:13,526 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 [0] [2022-12-06 06:20:13,615 INFO L130 PetriNetUnfolder]: 2599/5274 cut-off events. [2022-12-06 06:20:13,615 INFO L131 PetriNetUnfolder]: For 25551/25551 co-relation queries the response was YES. [2022-12-06 06:20:13,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21523 conditions, 5274 events. 2599/5274 cut-off events. For 25551/25551 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 36470 event pairs, 565 based on Foata normal form. 0/5244 useless extension candidates. Maximal degree in co-relation 18168. Up to 1866 conditions per place. [2022-12-06 06:20:13,646 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 198 selfloop transitions, 112 changer transitions 24/337 dead transitions. [2022-12-06 06:20:13,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 337 transitions, 3850 flow [2022-12-06 06:20:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:20:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:20:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 330 transitions. [2022-12-06 06:20:13,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.295169946332737 [2022-12-06 06:20:13,648 INFO L175 Difference]: Start difference. First operand has 95 places, 112 transitions, 1412 flow. Second operand 26 states and 330 transitions. [2022-12-06 06:20:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 337 transitions, 3850 flow [2022-12-06 06:20:13,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 337 transitions, 3702 flow, removed 72 selfloop flow, removed 4 redundant places. [2022-12-06 06:20:13,689 INFO L231 Difference]: Finished difference. Result has 120 places, 157 transitions, 2221 flow [2022-12-06 06:20:13,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2221, PETRI_PLACES=120, PETRI_TRANSITIONS=157} [2022-12-06 06:20:13,690 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2022-12-06 06:20:13,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:13,690 INFO L89 Accepts]: Start accepts. Operand has 120 places, 157 transitions, 2221 flow [2022-12-06 06:20:13,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:13,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:13,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 157 transitions, 2221 flow [2022-12-06 06:20:13,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 157 transitions, 2221 flow [2022-12-06 06:20:13,871 INFO L130 PetriNetUnfolder]: 516/1865 cut-off events. [2022-12-06 06:20:13,871 INFO L131 PetriNetUnfolder]: For 10231/10251 co-relation queries the response was YES. [2022-12-06 06:20:13,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 1865 events. 516/1865 cut-off events. For 10231/10251 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15421 event pairs, 217 based on Foata normal form. 11/1737 useless extension candidates. Maximal degree in co-relation 6202. Up to 563 conditions per place. [2022-12-06 06:20:13,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 157 transitions, 2221 flow [2022-12-06 06:20:13,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 1052 [2022-12-06 06:20:14,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [621] L962-->L946-1: Formula: (and (= (store |v_#memory_int_168| |v_t1Thread1of1ForFork0_push_~stack#1.base_70| (store (select |v_#memory_int_168| |v_t1Thread1of1ForFork0_push_~stack#1.base_70|) (+ (* |v_t1Thread1of1ForFork0_get_top_#res#1_66| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_70|) |v_t1Thread1of1ForFork0_push_~x#1_70|)) |v_#memory_int_167|) (<= |v_t1Thread1of1ForFork0_get_top_#res#1_66| 2147483647) (<= 0 (+ |v_t1Thread1of1ForFork0_get_top_#res#1_66| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_66| v_~top~0_380) (not (= 5 v_~top~0_380)) (= |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_241| v_~top~0_380)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_70|, #memory_int=|v_#memory_int_168|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_70|, ~top~0=v_~top~0_380, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_70|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_70|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_106|, #memory_int=|v_#memory_int_167|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_70|, ~top~0=v_~top~0_380, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_66|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_241|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_70|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [587] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_15|)) |v_#memory_int_122|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre47#1_15|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_30|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_7|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_29|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_15|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 06:20:14,943 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:20:14,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1254 [2022-12-06 06:20:14,944 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 153 transitions, 2216 flow [2022-12-06 06:20:14,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:14,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:14,944 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:14,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 06:20:15,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:15,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:15,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash 505566390, now seen corresponding path program 2 times [2022-12-06 06:20:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:15,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323749772] [2022-12-06 06:20:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:15,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323749772] [2022-12-06 06:20:15,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323749772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:20:15,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358927677] [2022-12-06 06:20:15,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:20:15,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:15,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:15,738 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-06 06:20:15,741 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-06 06:20:15,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:20:15,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:20:15,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-06 06:20:15,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:20:15,872 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:20:15,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 06:20:15,978 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 22 treesize of output 17 [2022-12-06 06:20:16,032 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 59 treesize of output 54 [2022-12-06 06:20:16,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:16,282 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 52 treesize of output 38 [2022-12-06 06:20:16,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:20:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:20:19,293 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_371) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-06 06:20:19,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:20:19,300 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-06 06:20:19,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:20:19,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2022-12-06 06:20:19,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:20:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:19,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358927677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:20:19,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:20:19,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-12-06 06:20:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734825275] [2022-12-06 06:20:19,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:20:19,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 06:20:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 06:20:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2022-12-06 06:20:19,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 50 [2022-12-06 06:20:19,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 153 transitions, 2216 flow. Second operand has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 29 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:19,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:19,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 50 [2022-12-06 06:20:19,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:23,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:20:27,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:20:30,118 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 [0] [2022-12-06 06:20:32,234 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 [0] [2022-12-06 06:20:32,808 INFO L130 PetriNetUnfolder]: 4442/9017 cut-off events. [2022-12-06 06:20:32,808 INFO L131 PetriNetUnfolder]: For 54430/54430 co-relation queries the response was YES. [2022-12-06 06:20:32,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37882 conditions, 9017 events. 4442/9017 cut-off events. For 54430/54430 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 66542 event pairs, 738 based on Foata normal form. 86/9079 useless extension candidates. Maximal degree in co-relation 34761. Up to 3141 conditions per place. [2022-12-06 06:20:32,860 INFO L137 encePairwiseOnDemand]: 11/50 looper letters, 208 selfloop transitions, 225 changer transitions 36/472 dead transitions. [2022-12-06 06:20:32,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 472 transitions, 6085 flow [2022-12-06 06:20:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 06:20:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 06:20:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 453 transitions. [2022-12-06 06:20:32,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2323076923076923 [2022-12-06 06:20:32,869 INFO L175 Difference]: Start difference. First operand has 116 places, 153 transitions, 2216 flow. Second operand 39 states and 453 transitions. [2022-12-06 06:20:32,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 472 transitions, 6085 flow [2022-12-06 06:20:32,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 472 transitions, 5867 flow, removed 61 selfloop flow, removed 7 redundant places. [2022-12-06 06:20:32,955 INFO L231 Difference]: Finished difference. Result has 168 places, 279 transitions, 4653 flow [2022-12-06 06:20:32,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4653, PETRI_PLACES=168, PETRI_TRANSITIONS=279} [2022-12-06 06:20:32,956 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places. [2022-12-06 06:20:32,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:32,956 INFO L89 Accepts]: Start accepts. Operand has 168 places, 279 transitions, 4653 flow [2022-12-06 06:20:32,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:32,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:32,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 279 transitions, 4653 flow [2022-12-06 06:20:32,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 279 transitions, 4653 flow [2022-12-06 06:20:33,713 INFO L130 PetriNetUnfolder]: 1150/3633 cut-off events. [2022-12-06 06:20:33,713 INFO L131 PetriNetUnfolder]: For 44601/44752 co-relation queries the response was YES. [2022-12-06 06:20:33,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21001 conditions, 3633 events. 1150/3633 cut-off events. For 44601/44752 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 31330 event pairs, 335 based on Foata normal form. 2/3371 useless extension candidates. Maximal degree in co-relation 20863. Up to 1180 conditions per place. [2022-12-06 06:20:33,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 279 transitions, 4653 flow [2022-12-06 06:20:33,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 1550 [2022-12-06 06:20:36,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1] and [600] L1006-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork1_~i~1#1_In_6| 5)) (= |v_t2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_In_6|} OutVars{t2Thread1of1ForFork1_#res#1.base=|v_t2Thread1of1ForFork1_#res#1.base_Out_4|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_In_6|, t2Thread1of1ForFork1_#res#1.offset=|v_t2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#res#1.base, t2Thread1of1ForFork1_#res#1.offset] [2022-12-06 06:20:36,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1] and [564] L1023-4-->L1024-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_10| (select (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#id1~0#1.base_15|) |v_ULTIMATE.start_main_~#id1~0#1.offset_15|)) InVars {#memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_10|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_5|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_13|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 06:20:36,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1] and [564] L1023-4-->L1024-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_10| (select (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#id1~0#1.base_15|) |v_ULTIMATE.start_main_~#id1~0#1.offset_15|)) InVars {#memory_int=|v_#memory_int_98|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_10|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_5|, #memory_int=|v_#memory_int_98|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_13|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_15|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 06:20:36,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L962-->L969-3: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| |v_t1Thread1of1ForFork0_push_#t~ret34#1_102|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483648)) (= |v_t1Thread1of1ForFork0_get_top_#res#1_62| v_~top~0_376) (= (store |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66| (store (select |v_#memory_int_158| |v_t1Thread1of1ForFork0_push_~stack#1.base_66|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_66| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 4)) |v_t1Thread1of1ForFork0_push_~x#1_66|)) |v_#memory_int_157|) (not (= 5 v_~top~0_376)) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_102| 2147483647)) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, #memory_int=|v_#memory_int_158|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} OutVars{t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_66|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_102|, #memory_int=|v_#memory_int_157|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_66|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_62|, ~top~0=v_~top~0_376, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_66|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, #memory_int, t1Thread1of1ForFork0_get_top_#res#1] and [600] L1006-6-->t2EXIT: Formula: (and (not (< |v_t2Thread1of1ForFork1_~i~1#1_In_6| 5)) (= |v_t2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_t2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_In_6|} OutVars{t2Thread1of1ForFork1_#res#1.base=|v_t2Thread1of1ForFork1_#res#1.base_Out_4|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_In_6|, t2Thread1of1ForFork1_#res#1.offset=|v_t2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#res#1.base, t2Thread1of1ForFork1_#res#1.offset] [2022-12-06 06:20:36,611 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 06:20:36,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3657 [2022-12-06 06:20:36,613 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 272 transitions, 4686 flow [2022-12-06 06:20:36,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.758620689655173) internal successors, (138), 29 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:36,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:36,614 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:36,622 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-06 06:20:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 06:20:36,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1420613169, now seen corresponding path program 1 times [2022-12-06 06:20:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:36,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120422050] [2022-12-06 06:20:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:36,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:36,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120422050] [2022-12-06 06:20:36,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120422050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:20:36,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048158341] [2022-12-06 06:20:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:36,916 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-06 06:20:36,951 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-06 06:20:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:37,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 06:20:37,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:20:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:37,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:20:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:37,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048158341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:20:37,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:20:37,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 06:20:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388499387] [2022-12-06 06:20:37,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:20:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:20:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:20:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:20:37,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 67 [2022-12-06 06:20:37,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 272 transitions, 4686 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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-06 06:20:37,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:37,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 67 [2022-12-06 06:20:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:39,010 INFO L130 PetriNetUnfolder]: 4502/9044 cut-off events. [2022-12-06 06:20:39,010 INFO L131 PetriNetUnfolder]: For 167327/167327 co-relation queries the response was YES. [2022-12-06 06:20:39,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61429 conditions, 9044 events. 4502/9044 cut-off events. For 167327/167327 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 68387 event pairs, 1618 based on Foata normal form. 117/9161 useless extension candidates. Maximal degree in co-relation 60980. Up to 3276 conditions per place. [2022-12-06 06:20:39,091 INFO L137 encePairwiseOnDemand]: 28/67 looper letters, 236 selfloop transitions, 172 changer transitions 10/421 dead transitions. [2022-12-06 06:20:39,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 421 transitions, 7534 flow [2022-12-06 06:20:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:20:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:20:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2022-12-06 06:20:39,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3067993366500829 [2022-12-06 06:20:39,092 INFO L175 Difference]: Start difference. First operand has 159 places, 272 transitions, 4686 flow. Second operand 9 states and 185 transitions. [2022-12-06 06:20:39,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 421 transitions, 7534 flow [2022-12-06 06:20:39,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 421 transitions, 6768 flow, removed 315 selfloop flow, removed 9 redundant places. [2022-12-06 06:20:39,327 INFO L231 Difference]: Finished difference. Result has 162 places, 304 transitions, 5352 flow [2022-12-06 06:20:39,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=4088, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5352, PETRI_PLACES=162, PETRI_TRANSITIONS=304} [2022-12-06 06:20:39,328 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places. [2022-12-06 06:20:39,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:39,329 INFO L89 Accepts]: Start accepts. Operand has 162 places, 304 transitions, 5352 flow [2022-12-06 06:20:39,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:39,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:39,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 304 transitions, 5352 flow [2022-12-06 06:20:39,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 304 transitions, 5352 flow [2022-12-06 06:20:39,892 INFO L130 PetriNetUnfolder]: 1263/3840 cut-off events. [2022-12-06 06:20:39,892 INFO L131 PetriNetUnfolder]: For 44833/44985 co-relation queries the response was YES. [2022-12-06 06:20:39,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22001 conditions, 3840 events. 1263/3840 cut-off events. For 44833/44985 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 34048 event pairs, 462 based on Foata normal form. 2/3574 useless extension candidates. Maximal degree in co-relation 20510. Up to 1132 conditions per place. [2022-12-06 06:20:39,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 304 transitions, 5352 flow [2022-12-06 06:20:39,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 1720 [2022-12-06 06:20:40,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:40,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 868 [2022-12-06 06:20:40,197 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 303 transitions, 5348 flow [2022-12-06 06:20:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 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-06 06:20:40,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:40,197 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:40,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 06:20:40,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:40,402 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1148349185, now seen corresponding path program 1 times [2022-12-06 06:20:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:40,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333396394] [2022-12-06 06:20:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:40,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333396394] [2022-12-06 06:20:40,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333396394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:20:40,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522472440] [2022-12-06 06:20:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:40,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:40,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:40,495 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-06 06:20:40,500 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-06 06:20:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:40,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 06:20:40,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:20:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:40,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:20:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:40,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522472440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:20:40,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:20:40,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 06:20:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438283060] [2022-12-06 06:20:40,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:20:40,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 06:20:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 06:20:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-06 06:20:40,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 66 [2022-12-06 06:20:40,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 303 transitions, 5348 flow. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:40,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:40,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 66 [2022-12-06 06:20:40,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:42,824 INFO L130 PetriNetUnfolder]: 5318/10598 cut-off events. [2022-12-06 06:20:42,825 INFO L131 PetriNetUnfolder]: For 183075/183075 co-relation queries the response was YES. [2022-12-06 06:20:42,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69559 conditions, 10598 events. 5318/10598 cut-off events. For 183075/183075 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 80914 event pairs, 1907 based on Foata normal form. 85/10683 useless extension candidates. Maximal degree in co-relation 64845. Up to 3636 conditions per place. [2022-12-06 06:20:42,903 INFO L137 encePairwiseOnDemand]: 25/66 looper letters, 247 selfloop transitions, 232 changer transitions 10/492 dead transitions. [2022-12-06 06:20:42,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 492 transitions, 8726 flow [2022-12-06 06:20:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:20:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:20:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2022-12-06 06:20:42,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2803030303030303 [2022-12-06 06:20:42,904 INFO L175 Difference]: Start difference. First operand has 161 places, 303 transitions, 5348 flow. Second operand 12 states and 222 transitions. [2022-12-06 06:20:42,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 492 transitions, 8726 flow [2022-12-06 06:20:43,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 492 transitions, 8602 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-06 06:20:43,274 INFO L231 Difference]: Finished difference. Result has 174 places, 350 transitions, 6950 flow [2022-12-06 06:20:43,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=5240, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6950, PETRI_PLACES=174, PETRI_TRANSITIONS=350} [2022-12-06 06:20:43,275 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2022-12-06 06:20:43,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:43,275 INFO L89 Accepts]: Start accepts. Operand has 174 places, 350 transitions, 6950 flow [2022-12-06 06:20:43,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:43,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:43,278 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 350 transitions, 6950 flow [2022-12-06 06:20:43,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 350 transitions, 6950 flow [2022-12-06 06:20:43,953 INFO L130 PetriNetUnfolder]: 1518/4625 cut-off events. [2022-12-06 06:20:43,954 INFO L131 PetriNetUnfolder]: For 62892/63033 co-relation queries the response was YES. [2022-12-06 06:20:43,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27690 conditions, 4625 events. 1518/4625 cut-off events. For 62892/63033 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 42133 event pairs, 572 based on Foata normal form. 2/4302 useless extension candidates. Maximal degree in co-relation 26108. Up to 1338 conditions per place. [2022-12-06 06:20:44,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 350 transitions, 6950 flow [2022-12-06 06:20:44,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 2070 [2022-12-06 06:20:44,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:44,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 972 [2022-12-06 06:20:44,247 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 350 transitions, 6956 flow [2022-12-06 06:20:44,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:44,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:44,248 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:44,253 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-06 06:20:44,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:44,453 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash -79538662, now seen corresponding path program 1 times [2022-12-06 06:20:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:44,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999240595] [2022-12-06 06:20:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:45,396 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-06 06:20:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:45,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999240595] [2022-12-06 06:20:45,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999240595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:20:45,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071713371] [2022-12-06 06:20:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:45,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:20:45,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:20:45,412 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-06 06:20:45,463 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-06 06:20:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:45,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 06:20:45,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:20:45,742 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 22 treesize of output 17 [2022-12-06 06:20:46,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:20:46,024 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 72 treesize of output 43 [2022-12-06 06:20:46,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:20:48,850 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-06 06:20:48,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:20:49,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-06 06:20:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:20:49,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071713371] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:20:49,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:20:49,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 25 [2022-12-06 06:20:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776984409] [2022-12-06 06:20:49,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:20:49,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 06:20:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 06:20:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=578, Unknown=1, NotChecked=0, Total=650 [2022-12-06 06:20:49,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 72 [2022-12-06 06:20:49,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 350 transitions, 6956 flow. Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:49,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:49,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 72 [2022-12-06 06:20:49,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:56,652 INFO L130 PetriNetUnfolder]: 6500/13203 cut-off events. [2022-12-06 06:20:56,652 INFO L131 PetriNetUnfolder]: For 213384/213384 co-relation queries the response was YES. [2022-12-06 06:20:56,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87521 conditions, 13203 events. 6500/13203 cut-off events. For 213384/213384 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 106557 event pairs, 1523 based on Foata normal form. 60/13215 useless extension candidates. Maximal degree in co-relation 81421. Up to 4427 conditions per place. [2022-12-06 06:20:56,757 INFO L137 encePairwiseOnDemand]: 25/72 looper letters, 370 selfloop transitions, 299 changer transitions 35/707 dead transitions. [2022-12-06 06:20:56,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 707 transitions, 12877 flow [2022-12-06 06:20:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 06:20:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 06:20:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 438 transitions. [2022-12-06 06:20:56,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20277777777777778 [2022-12-06 06:20:56,759 INFO L175 Difference]: Start difference. First operand has 174 places, 350 transitions, 6956 flow. Second operand 30 states and 438 transitions. [2022-12-06 06:20:56,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 707 transitions, 12877 flow [2022-12-06 06:20:57,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 707 transitions, 12581 flow, removed 148 selfloop flow, removed 0 redundant places. [2022-12-06 06:20:57,305 INFO L231 Difference]: Finished difference. Result has 216 places, 427 transitions, 9303 flow [2022-12-06 06:20:57,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=6687, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=9303, PETRI_PLACES=216, PETRI_TRANSITIONS=427} [2022-12-06 06:20:57,305 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2022-12-06 06:20:57,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:57,306 INFO L89 Accepts]: Start accepts. Operand has 216 places, 427 transitions, 9303 flow [2022-12-06 06:20:57,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:57,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:57,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 427 transitions, 9303 flow [2022-12-06 06:20:57,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 427 transitions, 9303 flow [2022-12-06 06:20:58,196 INFO L130 PetriNetUnfolder]: 1793/5570 cut-off events. [2022-12-06 06:20:58,197 INFO L131 PetriNetUnfolder]: For 88525/88690 co-relation queries the response was YES. [2022-12-06 06:20:58,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35558 conditions, 5570 events. 1793/5570 cut-off events. For 88525/88690 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 52934 event pairs, 682 based on Foata normal form. 1/5187 useless extension candidates. Maximal degree in co-relation 33438. Up to 1571 conditions per place. [2022-12-06 06:20:58,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 427 transitions, 9303 flow [2022-12-06 06:20:58,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 2510 [2022-12-06 06:20:58,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_15|)) |v_#memory_int_122|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre47#1_15|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_30|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_7|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_29|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_15|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] and [565] L946-1-->push_returnLabel#1: Formula: (and (= (+ 1 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|) v_~top~0_85) (= |v_t1Thread1of1ForFork0_push_#res#1_35| 0)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_42|} OutVars{t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_35|, ~top~0=v_~top~0_85} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#res#1, ~top~0, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-06 06:20:59,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [596] L992-6-->L962: Formula: (let ((.cse1 (mod |v_t1Thread1of1ForFork0_~tmp~0#1_Out_8| 4294967296)) (.cse0 (select |v_#pthreadsMutex_In_13| |v_~#m~0.base_In_16|))) (and (not (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4| |v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_10|) (= |v_t1Thread1of1ForFork0_#t~nondet40#1_In_3| |v_t1Thread1of1ForFork0_~tmp~0#1_Out_8|) (= |v_t1Thread1of1ForFork0_push_~stack#1.base_Out_10| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|) (< |v_t1Thread1of1ForFork0_~i~0#1_In_6| 5) (= |v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4| |v_~#arr~0.offset_In_9|) (= |v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_t1Thread1of1ForFork0_push_~x#1_Out_12| |v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|) (= (select .cse0 |v_~#m~0.offset_In_16|) 0) (= (ite (< .cse1 5) 1 0) |v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_~#arr~0.base_In_9| |v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|) (= (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) |v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|) (= |v_#pthreadsMutex_Out_28| (store |v_#pthreadsMutex_In_13| |v_~#m~0.base_In_16| (store .cse0 |v_~#m~0.offset_In_16| 1))))) InVars {~#arr~0.offset=|v_~#arr~0.offset_In_9|, #pthreadsMutex=|v_#pthreadsMutex_In_13|, ~#m~0.base=|v_~#m~0.base_In_16|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_6|, ~#m~0.offset=|v_~#m~0.offset_In_16|, ~#arr~0.base=|v_~#arr~0.base_In_9|, t1Thread1of1ForFork0_#t~nondet40#1=|v_t1Thread1of1ForFork0_#t~nondet40#1_In_3|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_In_9|, #pthreadsMutex=|v_#pthreadsMutex_Out_28|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_6|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_Out_12|, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_Out_8|, t1Thread1of1ForFork0_push_#in~stack#1.offset=|v_t1Thread1of1ForFork0_push_#in~stack#1.offset_Out_4|, t1Thread1of1ForFork0_push_#in~x#1=|v_t1Thread1of1ForFork0_push_#in~x#1_Out_4|, t1Thread1of1ForFork0_push_#in~stack#1.base=|v_t1Thread1of1ForFork0_push_#in~stack#1.base_Out_4|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_Out_14|, ~#m~0.base=|v_~#m~0.base_In_16|, t1Thread1of1ForFork0_~tmp~0#1=|v_t1Thread1of1ForFork0_~tmp~0#1_Out_8|, ~#m~0.offset=|v_~#m~0.offset_In_16|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_Out_10|, t1Thread1of1ForFork0_push_#t~nondet33#1=|v_t1Thread1of1ForFork0_push_#t~nondet33#1_Out_10|, t1Thread1of1ForFork0_#t~nondet39#1=|v_t1Thread1of1ForFork0_#t~nondet39#1_Out_6|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_Out_10|, ~#arr~0.base=|v_~#arr~0.base_In_9|, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_push_~x#1, t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_push_#in~stack#1.offset, t1Thread1of1ForFork0_push_#in~x#1, t1Thread1of1ForFork0_push_#in~stack#1.base, t1Thread1of1ForFork0_#t~nondet40#1, t1Thread1of1ForFork0_push_#res#1, t1Thread1of1ForFork0_~tmp~0#1, t1Thread1of1ForFork0_push_~stack#1.base, t1Thread1of1ForFork0_push_#t~nondet33#1, t1Thread1of1ForFork0_#t~nondet39#1, t1Thread1of1ForFork0_push_~stack#1.offset, t1Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [587] L1022-4-->L1023-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#id2~0#1.base_17|) |v_ULTIMATE.start_main_~#id2~0#1.offset_17| |v_ULTIMATE.start_main_#t~pre47#1_15|)) |v_#memory_int_122|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre47#1_15|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_30|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_7|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_17|, #pthreadsForks=|v_#pthreadsForks_29|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_15|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_17|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 06:20:59,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] and [684] L1022-4-->push_returnLabel#1: Formula: (and (= (+ |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_313| 1) v_~top~0_672) (= (+ |v_#pthreadsForks_57| 1) |v_#pthreadsForks_56|) (= |v_#pthreadsForks_57| |v_ULTIMATE.start_main_#t~pre47#1_60|) (= |v_t1Thread1of1ForFork0_push_#res#1_223| 0) (= |v_#memory_int_363| (store |v_#memory_int_364| |v_ULTIMATE.start_main_~#id2~0#1.base_39| (store (select |v_#memory_int_364| |v_ULTIMATE.start_main_~#id2~0#1.base_39|) |v_ULTIMATE.start_main_~#id2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre47#1_60|)))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_57|, #memory_int=|v_#memory_int_364|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_39|, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_313|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_24|, t1Thread1of1ForFork0_push_#res#1=|v_t1Thread1of1ForFork0_push_#res#1_223|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_363|, ~top~0=v_~top~0_672, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_60|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_39|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, t1Thread1of1ForFork0_push_#res#1, #pthreadsForks, #memory_int, ~top~0, ULTIMATE.start_main_#t~pre47#1, t1Thread1of1ForFork0_inc_top_#t~post31#1, ULTIMATE.start_main_#t~pre45#1] [2022-12-06 06:20:59,952 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:20:59,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2648 [2022-12-06 06:20:59,953 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 423 transitions, 9362 flow [2022-12-06 06:20:59,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 26 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:59,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:59,953 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:59,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 06:21:00,154 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,SelfDestructingSolverStorable14 [2022-12-06 06:21:00,154 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:21:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1955049566, now seen corresponding path program 1 times [2022-12-06 06:21:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:00,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632554992] [2022-12-06 06:21:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:00,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:01,013 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-06 06:21:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:01,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632554992] [2022-12-06 06:21:01,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632554992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:21:01,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357399454] [2022-12-06 06:21:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:01,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:21:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:01,024 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-06 06:21:01,027 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-06 06:21:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:01,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 06:21:01,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:21:01,149 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 06:21:01,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-06 06:21:01,232 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 15 treesize of output 11 [2022-12-06 06:21:01,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:21:01,447 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2022-12-06 06:21:01,451 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 50 treesize of output 46 [2022-12-06 06:21:01,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:21:03,765 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-06 06:21:03,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:21:04,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:21:04,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:21:04,240 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-06 06:21:04,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-06 06:21:04,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:21:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:21:06,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357399454] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:21:06,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:21:06,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2022-12-06 06:21:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742060942] [2022-12-06 06:21:06,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:21:06,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 06:21:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 06:21:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=650, Unknown=6, NotChecked=0, Total=756 [2022-12-06 06:21:06,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 83 [2022-12-06 06:21:06,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 423 transitions, 9362 flow. Second operand has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:06,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:06,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 83 [2022-12-06 06:21:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:10,376 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-06 06:21:14,696 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-06 06:21:22,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 06:21:24,919 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-06 06:21:26,488 INFO L130 PetriNetUnfolder]: 10268/20990 cut-off events. [2022-12-06 06:21:26,489 INFO L131 PetriNetUnfolder]: For 384851/384851 co-relation queries the response was YES. [2022-12-06 06:21:26,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144832 conditions, 20990 events. 10268/20990 cut-off events. For 384851/384851 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 179398 event pairs, 3250 based on Foata normal form. 54/20948 useless extension candidates. Maximal degree in co-relation 124540. Up to 6936 conditions per place. [2022-12-06 06:21:26,724 INFO L137 encePairwiseOnDemand]: 30/83 looper letters, 603 selfloop transitions, 264 changer transitions 19/889 dead transitions. [2022-12-06 06:21:26,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 889 transitions, 19626 flow [2022-12-06 06:21:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:21:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:21:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 392 transitions. [2022-12-06 06:21:26,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21467688937568455 [2022-12-06 06:21:26,726 INFO L175 Difference]: Start difference. First operand has 212 places, 423 transitions, 9362 flow. Second operand 22 states and 392 transitions. [2022-12-06 06:21:26,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 889 transitions, 19626 flow [2022-12-06 06:21:27,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 889 transitions, 19156 flow, removed 232 selfloop flow, removed 5 redundant places. [2022-12-06 06:21:27,679 INFO L231 Difference]: Finished difference. Result has 245 places, 597 transitions, 14771 flow [2022-12-06 06:21:27,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=9100, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=14771, PETRI_PLACES=245, PETRI_TRANSITIONS=597} [2022-12-06 06:21:27,680 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places. [2022-12-06 06:21:27,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:27,681 INFO L89 Accepts]: Start accepts. Operand has 245 places, 597 transitions, 14771 flow [2022-12-06 06:21:27,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:27,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:27,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 597 transitions, 14771 flow [2022-12-06 06:21:27,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 597 transitions, 14771 flow [2022-12-06 06:21:29,461 INFO L130 PetriNetUnfolder]: 2643/8613 cut-off events. [2022-12-06 06:21:29,461 INFO L131 PetriNetUnfolder]: For 175200/175406 co-relation queries the response was YES. [2022-12-06 06:21:29,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58826 conditions, 8613 events. 2643/8613 cut-off events. For 175200/175406 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 87390 event pairs, 1016 based on Foata normal form. 2/8032 useless extension candidates. Maximal degree in co-relation 57382. Up to 2286 conditions per place. [2022-12-06 06:21:29,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 597 transitions, 14771 flow [2022-12-06 06:21:29,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 3498 [2022-12-06 06:21:29,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [673] L962-->L1024-1: Formula: (and (= (select (select |v_#memory_int_341| |v_ULTIMATE.start_main_~#id1~0#1.base_51|) |v_ULTIMATE.start_main_~#id1~0#1.offset_51|) |v_ULTIMATE.start_main_#t~mem49#1_42|) (= |v_t1Thread1of1ForFork0_get_top_#res#1_117| v_~top~0_627) (<= |v_t1Thread1of1ForFork0_push_#t~ret34#1_183| 2147483647) (= (store |v_#memory_int_342| |v_t1Thread1of1ForFork0_push_~stack#1.base_128| (store (select |v_#memory_int_342| |v_t1Thread1of1ForFork0_push_~stack#1.base_128|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_183| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_128|) |v_t1Thread1of1ForFork0_push_~x#1_128|)) |v_#memory_int_341|) (= |v_t1Thread1of1ForFork0_get_top_#res#1_117| |v_t1Thread1of1ForFork0_push_#t~ret34#1_183|) (not (= 5 v_~top~0_627)) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret34#1_183| 2147483648))) InVars {t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_128|, #memory_int=|v_#memory_int_342|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_128|, ~top~0=v_~top~0_627, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_51|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_128|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_51|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_42|, t1Thread1of1ForFork0_push_~x#1=|v_t1Thread1of1ForFork0_push_~x#1_128|, t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_183|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_37|, #memory_int=|v_#memory_int_341|, t1Thread1of1ForFork0_push_~stack#1.base=|v_t1Thread1of1ForFork0_push_~stack#1.base_128|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_57|, t1Thread1of1ForFork0_get_top_#res#1=|v_t1Thread1of1ForFork0_get_top_#res#1_117|, ~top~0=v_~top~0_627, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_51|, t1Thread1of1ForFork0_push_~stack#1.offset=|v_t1Thread1of1ForFork0_push_~stack#1.offset_128|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, t1Thread1of1ForFork0_push_#t~ret34#1, ULTIMATE.start_main_#t~nondet48#1, #memory_int, ULTIMATE.start_main_#t~pre47#1, t1Thread1of1ForFork0_get_top_#res#1] and [532] L969-3-->L946-1: Formula: (= v_~top~0_43 |v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|) InVars {~top~0=v_~top~0_43} OutVars{t1Thread1of1ForFork0_push_#t~ret34#1=|v_t1Thread1of1ForFork0_push_#t~ret34#1_23|, ~top~0=v_~top~0_43, t1Thread1of1ForFork0_inc_top_#t~post31#1=|v_t1Thread1of1ForFork0_inc_top_#t~post31#1_27|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#t~ret34#1, t1Thread1of1ForFork0_inc_top_#t~post31#1] [2022-12-06 06:21:32,181 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 06:21:32,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4503 [2022-12-06 06:21:32,183 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 595 transitions, 14853 flow [2022-12-06 06:21:32,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:32,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:32,183 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:32,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 06:21:32,389 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,SelfDestructingSolverStorable15 [2022-12-06 06:21:32,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:21:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1175923444, now seen corresponding path program 1 times [2022-12-06 06:21:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821598982] [2022-12-06 06:21:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:32,995 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-06 06:21:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821598982] [2022-12-06 06:21:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821598982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:21:32,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190963155] [2022-12-06 06:21:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:32,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:21:32,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:32,997 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-06 06:21:33,003 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-06 06:21:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:33,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 06:21:33,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:21:33,212 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 22 treesize of output 17 [2022-12-06 06:21:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:21:33,293 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 72 treesize of output 43 [2022-12-06 06:21:33,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:21:33,406 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 72 treesize of output 43 [2022-12-06 06:21:33,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-06 06:21:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:35,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:21:36,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-06 06:21:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:21:36,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190963155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:21:36,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:21:36,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 06:21:36,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560751500] [2022-12-06 06:21:36,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:21:36,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 06:21:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 06:21:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=524, Unknown=1, NotChecked=0, Total=600 [2022-12-06 06:21:36,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 97 [2022-12-06 06:21:36,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 595 transitions, 14853 flow. Second operand has 25 states, 25 states have (on average 5.4) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:36,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:36,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 97 [2022-12-06 06:21:36,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:39,635 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] [2022-12-06 06:21:41,667 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] [2022-12-06 06:21:43,959 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 [0] [2022-12-06 06:21:46,277 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] [2022-12-06 06:21:48,467 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 [0] [2022-12-06 06:21:50,503 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] [2022-12-06 06:21:52,540 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 [0] [2022-12-06 06:21:54,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:21:56,614 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 [0] [2022-12-06 06:21:58,636 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 [0] [2022-12-06 06:22:00,656 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 [0] [2022-12-06 06:22:03,248 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 [0] [2022-12-06 06:22:04,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:06,403 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 [0] [2022-12-06 06:22:08,582 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 [0] [2022-12-06 06:22:10,619 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 [0] [2022-12-06 06:22:12,884 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 [0] [2022-12-06 06:22:14,920 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 [0] [2022-12-06 06:22:16,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:17,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:19,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:21,747 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 [0] [2022-12-06 06:22:23,799 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 [0] [2022-12-06 06:22:25,832 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 [0] [2022-12-06 06:22:27,910 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] [2022-12-06 06:22:29,941 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 [0] [2022-12-06 06:22:32,339 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] [2022-12-06 06:22:34,365 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 [0] [2022-12-06 06:22:36,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:38,205 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 [0] [2022-12-06 06:22:41,488 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 [0] [2022-12-06 06:22:43,524 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 [0] [2022-12-06 06:22:45,572 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 [0] [2022-12-06 06:22:47,636 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 [0] [2022-12-06 06:22:50,856 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] [2022-12-06 06:22:53,086 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 [0] [2022-12-06 06:22:55,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:22:57,739 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] [2022-12-06 06:23:00,134 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 [0] [2022-12-06 06:23:02,164 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 [0] [2022-12-06 06:23:04,707 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 [0] [2022-12-06 06:23:07,462 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 [0] [2022-12-06 06:23:09,641 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] [2022-12-06 06:23:11,678 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] [2022-12-06 06:23:13,712 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 [0] [2022-12-06 06:23:15,768 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 [0] [2022-12-06 06:23:17,821 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 [0] [2022-12-06 06:23:19,883 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 [0] [2022-12-06 06:23:21,909 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 [0] [2022-12-06 06:23:23,944 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 [0] [2022-12-06 06:23:25,977 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 [0] [2022-12-06 06:23:28,046 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] [2022-12-06 06:23:31,447 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 [0] [2022-12-06 06:23:33,506 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 [0] [2022-12-06 06:23:35,541 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 [0] [2022-12-06 06:23:38,102 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 [0] [2022-12-06 06:23:40,148 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] [2022-12-06 06:23:42,373 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 [0] [2022-12-06 06:23:44,539 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 [0] [2022-12-06 06:23:46,652 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 [0] [2022-12-06 06:23:48,927 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 [0] [2022-12-06 06:23:51,040 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 [0] [2022-12-06 06:23:53,163 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] [2022-12-06 06:23:55,601 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] [2022-12-06 06:23:57,784 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] [2022-12-06 06:23:59,948 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 [0] [2022-12-06 06:24:02,441 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 [0] [2022-12-06 06:24:04,776 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] [2022-12-06 06:24:07,110 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 [0] [2022-12-06 06:24:11,254 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] [2022-12-06 06:24:14,877 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] [2022-12-06 06:24:17,194 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 [0] [2022-12-06 06:24:19,224 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 [0] [2022-12-06 06:24:21,256 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 [0] [2022-12-06 06:24:22,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:24:24,824 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 [0] [2022-12-06 06:24:27,350 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 [0] [2022-12-06 06:24:29,483 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 [0] [2022-12-06 06:24:31,686 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 [0] [2022-12-06 06:24:33,722 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] [2022-12-06 06:24:36,075 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 [0] [2022-12-06 06:24:38,409 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] [2022-12-06 06:24:40,666 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 [0] [2022-12-06 06:24:42,797 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 [0] [2022-12-06 06:24:44,861 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 [0] [2022-12-06 06:24:46,912 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 [0] [2022-12-06 06:24:49,092 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 [0] [2022-12-06 06:24:51,259 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 [0] [2022-12-06 06:24:53,292 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 [0] [2022-12-06 06:24:55,333 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 [0] [2022-12-06 06:24:57,607 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 [0] [2022-12-06 06:25:00,041 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 [0] [2022-12-06 06:25:02,116 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 [0] [2022-12-06 06:25:04,268 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 [0] [2022-12-06 06:25:06,394 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 [0] [2022-12-06 06:25:08,462 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 [0] [2022-12-06 06:25:10,594 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 [0] [2022-12-06 06:25:12,644 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] [2022-12-06 06:25:16,834 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 [0] [2022-12-06 06:25:18,903 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 [0] [2022-12-06 06:25:21,056 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 [0] [2022-12-06 06:25:23,147 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 [0] [2022-12-06 06:25:25,209 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 [0] [2022-12-06 06:25:27,250 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 [0] [2022-12-06 06:25:29,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 06:25:30,671 INFO L130 PetriNetUnfolder]: 12915/26459 cut-off events. [2022-12-06 06:25:30,672 INFO L131 PetriNetUnfolder]: For 563363/563363 co-relation queries the response was YES. [2022-12-06 06:25:30,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190414 conditions, 26459 events. 12915/26459 cut-off events. For 563363/563363 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 234882 event pairs, 3146 based on Foata normal form. 0/26371 useless extension candidates. Maximal degree in co-relation 186492. Up to 8611 conditions per place. [2022-12-06 06:25:30,973 INFO L137 encePairwiseOnDemand]: 33/97 looper letters, 426 selfloop transitions, 578 changer transitions 44/1051 dead transitions. [2022-12-06 06:25:30,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1051 transitions, 24627 flow [2022-12-06 06:25:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 06:25:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 06:25:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 429 transitions. [2022-12-06 06:25:30,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19229045271178843 [2022-12-06 06:25:30,976 INFO L175 Difference]: Start difference. First operand has 243 places, 595 transitions, 14853 flow. Second operand 23 states and 429 transitions. [2022-12-06 06:25:30,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1051 transitions, 24627 flow [2022-12-06 06:25:32,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1051 transitions, 24013 flow, removed 303 selfloop flow, removed 4 redundant places. [2022-12-06 06:25:32,457 INFO L231 Difference]: Finished difference. Result has 266 places, 741 transitions, 19982 flow [2022-12-06 06:25:32,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=14465, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=433, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=19982, PETRI_PLACES=266, PETRI_TRANSITIONS=741} [2022-12-06 06:25:32,463 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places. [2022-12-06 06:25:32,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:32,464 INFO L89 Accepts]: Start accepts. Operand has 266 places, 741 transitions, 19982 flow [2022-12-06 06:25:32,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:32,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:32,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 741 transitions, 19982 flow [2022-12-06 06:25:32,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 741 transitions, 19982 flow [2022-12-06 06:25:34,460 INFO L130 PetriNetUnfolder]: 3333/10924 cut-off events. [2022-12-06 06:25:34,461 INFO L131 PetriNetUnfolder]: For 242242/242498 co-relation queries the response was YES. [2022-12-06 06:25:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76704 conditions, 10924 events. 3333/10924 cut-off events. For 242242/242498 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 115623 event pairs, 1285 based on Foata normal form. 2/10226 useless extension candidates. Maximal degree in co-relation 75307. Up to 2833 conditions per place. [2022-12-06 06:25:34,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 741 transitions, 19982 flow [2022-12-06 06:25:34,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 4310 [2022-12-06 06:25:36,161 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:25:36,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3699 [2022-12-06 06:25:36,162 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 740 transitions, 20004 flow [2022-12-06 06:25:36,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.4) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:36,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:36,162 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:36,184 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-06 06:25:36,379 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,SelfDestructingSolverStorable16 [2022-12-06 06:25:36,379 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1255397016, now seen corresponding path program 1 times [2022-12-06 06:25:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:36,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429948599] [2022-12-06 06:25:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:37,212 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-06 06:25:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:37,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429948599] [2022-12-06 06:25:37,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429948599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:25:37,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391364551] [2022-12-06 06:25:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:37,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:25:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:25:37,228 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-06 06:25:37,235 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-06 06:25:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:37,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 06:25:37,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:25:37,517 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 22 treesize of output 17 [2022-12-06 06:25:37,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:25:37,677 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 60 treesize of output 40 [2022-12-06 06:25:37,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-06 06:25:41,340 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-06 06:25:41,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:25:41,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-12-06 06:25:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 06:25:41,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391364551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:25:41,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:25:41,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2022-12-06 06:25:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357609383] [2022-12-06 06:25:41,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:25:41,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 06:25:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 06:25:41,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-12-06 06:25:41,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 105 [2022-12-06 06:25:41,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 740 transitions, 20004 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:41,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:41,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 105 [2022-12-06 06:25:41,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:51,856 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 [0, 1] [2022-12-06 06:26:01,543 INFO L130 PetriNetUnfolder]: 16841/34328 cut-off events. [2022-12-06 06:26:01,543 INFO L131 PetriNetUnfolder]: For 798545/798545 co-relation queries the response was YES. [2022-12-06 06:26:01,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254108 conditions, 34328 events. 16841/34328 cut-off events. For 798545/798545 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 309596 event pairs, 4506 based on Foata normal form. 90/34418 useless extension candidates. Maximal degree in co-relation 248198. Up to 11224 conditions per place. [2022-12-06 06:26:01,921 INFO L137 encePairwiseOnDemand]: 31/105 looper letters, 473 selfloop transitions, 800 changer transitions 39/1315 dead transitions. [2022-12-06 06:26:01,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1315 transitions, 33164 flow [2022-12-06 06:26:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 06:26:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 06:26:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 544 transitions. [2022-12-06 06:26:01,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1439153439153439 [2022-12-06 06:26:01,924 INFO L175 Difference]: Start difference. First operand has 265 places, 740 transitions, 20004 flow. Second operand 36 states and 544 transitions. [2022-12-06 06:26:01,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1315 transitions, 33164 flow [2022-12-06 06:26:03,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 1315 transitions, 33126 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 06:26:03,914 INFO L231 Difference]: Finished difference. Result has 311 places, 976 transitions, 29236 flow [2022-12-06 06:26:03,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=19970, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=569, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=29236, PETRI_PLACES=311, PETRI_TRANSITIONS=976} [2022-12-06 06:26:03,915 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 269 predicate places. [2022-12-06 06:26:03,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:26:03,915 INFO L89 Accepts]: Start accepts. Operand has 311 places, 976 transitions, 29236 flow [2022-12-06 06:26:03,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:26:03,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:26:03,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 976 transitions, 29236 flow [2022-12-06 06:26:03,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 976 transitions, 29236 flow [2022-12-06 06:26:07,318 INFO L130 PetriNetUnfolder]: 4216/14025 cut-off events. [2022-12-06 06:26:07,319 INFO L131 PetriNetUnfolder]: For 388520/388861 co-relation queries the response was YES. [2022-12-06 06:26:07,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106786 conditions, 14025 events. 4216/14025 cut-off events. For 388520/388861 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 152510 event pairs, 1653 based on Foata normal form. 3/13130 useless extension candidates. Maximal degree in co-relation 104027. Up to 3594 conditions per place. [2022-12-06 06:26:07,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 976 transitions, 29236 flow [2022-12-06 06:26:07,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 5684 [2022-12-06 06:26:08,680 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:26:08,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4766 [2022-12-06 06:26:08,681 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 975 transitions, 29252 flow [2022-12-06 06:26:08,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:08,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:26:08,681 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:26:08,705 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-06 06:26:08,882 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,SelfDestructingSolverStorable17 [2022-12-06 06:26:08,882 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:26:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:26:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash -41281913, now seen corresponding path program 1 times [2022-12-06 06:26:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:26:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659789808] [2022-12-06 06:26:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:26:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:09,682 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-06 06:26:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:26:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659789808] [2022-12-06 06:26:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659789808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:26:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526067556] [2022-12-06 06:26:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:26:09,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:26:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:26:09,684 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-06 06:26:09,686 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-06 06:26:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:26:09,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-06 06:26:09,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:26:09,835 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:26:09,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 06:26:09,904 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 13 treesize of output 9 [2022-12-06 06:26:09,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:26:09,949 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 25 [2022-12-06 06:26:10,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:26:10,038 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 25 [2022-12-06 06:26:10,071 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 21 treesize of output 21 [2022-12-06 06:26:10,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:26:10,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2022-12-06 06:26:10,219 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-06 06:26:10,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:26:10,296 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_868) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))) is different from false [2022-12-06 06:26:14,232 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-12-06 06:26:14,232 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-12-06 06:26:14,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:26:14,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2022-12-06 06:26:14,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:26:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:26:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526067556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:26:18,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:26:18,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-12-06 06:26:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935554342] [2022-12-06 06:26:18,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:26:18,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 06:26:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:26:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 06:26:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=697, Unknown=8, NotChecked=54, Total=870 [2022-12-06 06:26:18,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 111 [2022-12-06 06:26:18,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 975 transitions, 29252 flow. Second operand has 30 states, 30 states have (on average 4.666666666666667) internal successors, (140), 30 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:26:18,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:26:18,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 111 [2022-12-06 06:26:18,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:26:57,788 INFO L130 PetriNetUnfolder]: 26569/54332 cut-off events. [2022-12-06 06:26:57,788 INFO L131 PetriNetUnfolder]: For 1456412/1456412 co-relation queries the response was YES. [2022-12-06 06:26:58,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420818 conditions, 54332 events. 26569/54332 cut-off events. For 1456412/1456412 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 526164 event pairs, 7602 based on Foata normal form. 32/54364 useless extension candidates. Maximal degree in co-relation 413599. Up to 17535 conditions per place. [2022-12-06 06:26:59,062 INFO L137 encePairwiseOnDemand]: 34/111 looper letters, 843 selfloop transitions, 868 changer transitions 62/1776 dead transitions. [2022-12-06 06:26:59,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1776 transitions, 51204 flow [2022-12-06 06:26:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 06:26:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 06:26:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 534 transitions. [2022-12-06 06:26:59,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1718146718146718 [2022-12-06 06:26:59,071 INFO L175 Difference]: Start difference. First operand has 310 places, 975 transitions, 29252 flow. Second operand 28 states and 534 transitions. [2022-12-06 06:26:59,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1776 transitions, 51204 flow [2022-12-06 06:27:05,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1776 transitions, 50726 flow, removed 230 selfloop flow, removed 6 redundant places. [2022-12-06 06:27:05,103 INFO L231 Difference]: Finished difference. Result has 352 places, 1348 transitions, 45179 flow [2022-12-06 06:27:05,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=28994, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=530, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=45179, PETRI_PLACES=352, PETRI_TRANSITIONS=1348} [2022-12-06 06:27:05,104 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 310 predicate places. [2022-12-06 06:27:05,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:27:05,104 INFO L89 Accepts]: Start accepts. Operand has 352 places, 1348 transitions, 45179 flow [2022-12-06 06:27:05,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:27:05,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:27:05,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 352 places, 1348 transitions, 45179 flow [2022-12-06 06:27:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 352 places, 1348 transitions, 45179 flow [2022-12-06 06:27:12,242 INFO L130 PetriNetUnfolder]: 6526/21647 cut-off events. [2022-12-06 06:27:12,242 INFO L131 PetriNetUnfolder]: For 735601/736572 co-relation queries the response was YES. [2022-12-06 06:27:12,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180363 conditions, 21647 events. 6526/21647 cut-off events. For 735601/736572 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 252321 event pairs, 2490 based on Foata normal form. 1/20240 useless extension candidates. Maximal degree in co-relation 179061. Up to 5515 conditions per place. [2022-12-06 06:27:13,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 352 places, 1348 transitions, 45179 flow [2022-12-06 06:27:13,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 8024 [2022-12-06 06:27:15,650 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:27:15,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10546 [2022-12-06 06:27:15,651 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 1345 transitions, 45216 flow [2022-12-06 06:27:15,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.666666666666667) internal successors, (140), 30 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:15,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:27:15,651 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:27:15,658 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-06 06:27:15,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:27:15,856 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:27:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:27:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -476931686, now seen corresponding path program 1 times [2022-12-06 06:27:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:27:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774584984] [2022-12-06 06:27:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:27:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:27:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774584984] [2022-12-06 06:27:16,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774584984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:27:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551443276] [2022-12-06 06:27:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:27:16,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:27:16,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:27:16,618 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-06 06:27:16,620 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-06 06:27:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:27:16,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-06 06:27:16,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:27:16,762 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 06:27:16,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-06 06:27:16,825 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 13 treesize of output 9 [2022-12-06 06:27:16,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:27:16,874 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 25 [2022-12-06 06:27:16,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 06:27:16,949 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-06 06:27:16,953 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 21 treesize of output 21 [2022-12-06 06:27:17,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:27:17,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2022-12-06 06:27:17,121 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-06 06:27:17,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:27:21,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 06:27:21,598 INFO L321 Elim1Store]: treesize reduction 65, result has 50.8 percent of original size [2022-12-06 06:27:21,598 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 3 case distinctions, treesize of input 61 treesize of output 84 [2022-12-06 06:27:21,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 06:27:21,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 73 [2022-12-06 06:27:21,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-06 06:27:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:27:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551443276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:27:27,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:27:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 29 [2022-12-06 06:27:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822732265] [2022-12-06 06:27:27,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:27:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 06:27:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:27:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 06:27:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=796, Unknown=14, NotChecked=0, Total=930 [2022-12-06 06:27:27,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 124 [2022-12-06 06:27:27,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1345 transitions, 45216 flow. Second operand has 31 states, 31 states have (on average 4.612903225806452) internal successors, (143), 31 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:27:27,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:27:27,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 124 [2022-12-06 06:27:27,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:25,606 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-06 06:28:27,647 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-06 06:29:05,187 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-06 06:29:11,746 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-06 06:29:18,925 INFO L130 PetriNetUnfolder]: 43467/88508 cut-off events. [2022-12-06 06:29:18,925 INFO L131 PetriNetUnfolder]: For 2937179/2937179 co-relation queries the response was YES. [2022-12-06 06:29:20,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741498 conditions, 88508 events. 43467/88508 cut-off events. For 2937179/2937179 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 895967 event pairs, 10392 based on Foata normal form. 168/88676 useless extension candidates. Maximal degree in co-relation 735883. Up to 28726 conditions per place. [2022-12-06 06:29:21,214 INFO L137 encePairwiseOnDemand]: 26/124 looper letters, 779 selfloop transitions, 1602 changer transitions 53/2437 dead transitions. [2022-12-06 06:29:21,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 2437 transitions, 78627 flow [2022-12-06 06:29:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 06:29:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 06:29:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 692 transitions. [2022-12-06 06:29:21,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13951612903225807 [2022-12-06 06:29:21,217 INFO L175 Difference]: Start difference. First operand has 349 places, 1345 transitions, 45216 flow. Second operand 40 states and 692 transitions. [2022-12-06 06:29:21,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 2437 transitions, 78627 flow Received shutdown request... [2022-12-06 06:29:24,994 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-06 06:29:24,995 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:29:25,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:29:25,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 06:29:25,542 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,SelfDestructingSolverStorable19 [2022-12-06 06:29:25,543 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 06:29:25,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 06:29:25,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:29:25,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-06 06:29:25,545 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-06 06:29:25,545 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:29:25,545 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:25,548 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:29:25,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:29:25,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:29:25 BasicIcfg [2022-12-06 06:29:25,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:29:25,550 INFO L158 Benchmark]: Toolchain (without parser) took 840503.13ms. Allocated memory was 183.5MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 145.8MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-06 06:29:25,551 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:29:25,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 871.68ms. Allocated memory is still 183.5MB. Free memory was 145.3MB in the beginning and 116.4MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:29:25,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.91ms. Allocated memory is still 183.5MB. Free memory was 116.4MB in the beginning and 113.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:29:25,551 INFO L158 Benchmark]: Boogie Preprocessor took 42.97ms. Allocated memory is still 183.5MB. Free memory was 113.8MB in the beginning and 111.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:29:25,551 INFO L158 Benchmark]: RCFGBuilder took 586.79ms. Allocated memory is still 183.5MB. Free memory was 111.7MB in the beginning and 94.4MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 06:29:25,551 INFO L158 Benchmark]: TraceAbstraction took 838910.30ms. Allocated memory was 183.5MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 93.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 06:29:25,552 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.09ms. Allocated memory is still 183.5MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 871.68ms. Allocated memory is still 183.5MB. Free memory was 145.3MB in the beginning and 116.4MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.91ms. Allocated memory is still 183.5MB. Free memory was 116.4MB in the beginning and 113.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.97ms. Allocated memory is still 183.5MB. Free memory was 113.8MB in the beginning and 111.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 586.79ms. Allocated memory is still 183.5MB. Free memory was 111.7MB in the beginning and 94.4MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 838910.30ms. Allocated memory was 183.5MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 93.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 140 PlacesBefore, 42 PlacesAfterwards, 143 TransitionsBefore, 40 TransitionsAfterwards, 6382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 76 ConcurrentYvCompositions, 5 ChoiceCompositions, 114 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 5585, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 0, independent unconditional: 5585, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 0, independent unconditional: 5585, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5670, independent: 5585, independent conditional: 0, independent unconditional: 5585, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4210, independent: 4158, independent conditional: 0, independent unconditional: 4158, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4210, independent: 4143, independent conditional: 0, independent unconditional: 4143, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5670, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 4210, unknown conditional: 0, unknown unconditional: 4210] , Statistics on independence cache: Total cache size (in pairs): 7673, Positive cache size: 7621, Positive conditional cache size: 0, Positive unconditional cache size: 7621, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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, 39 TransitionsBefore, 39 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 2, independent unconditional: 175, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, independent: 177, independent conditional: 1, independent unconditional: 176, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, independent: 177, independent conditional: 1, independent unconditional: 176, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 178, independent: 158, independent conditional: 1, independent unconditional: 157, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 178, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 3, independent conditional: 1, independent unconditional: 3, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 178, unknown conditional: 2, unknown unconditional: 176] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 158, Positive conditional cache size: 1, Positive unconditional cache size: 157, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 4, independent unconditional: 64, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 168, Positive conditional cache size: 1, Positive unconditional cache size: 167, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 59 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 659, independent: 611, independent conditional: 611, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 659, independent: 611, independent conditional: 231, independent unconditional: 380, dependent: 48, dependent conditional: 32, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 659, independent: 611, independent conditional: 108, independent unconditional: 503, dependent: 48, dependent conditional: 24, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 659, independent: 611, independent conditional: 108, independent unconditional: 503, dependent: 48, dependent conditional: 24, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 97, independent conditional: 23, independent unconditional: 74, dependent: 13, dependent conditional: 11, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 11, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 659, independent: 514, independent conditional: 85, independent unconditional: 429, dependent: 35, dependent conditional: 13, dependent unconditional: 22, unknown: 110, unknown conditional: 34, unknown unconditional: 76] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 274, Positive conditional cache size: 24, Positive unconditional cache size: 250, Negative cache size: 37, Negative conditional cache size: 12, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 131, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 1054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, independent: 226, independent conditional: 226, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 252, independent: 226, independent conditional: 61, independent unconditional: 165, dependent: 26, dependent conditional: 18, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, independent: 226, independent conditional: 13, independent unconditional: 213, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 226, independent conditional: 13, independent unconditional: 213, dependent: 26, dependent conditional: 12, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, independent: 220, independent conditional: 12, independent unconditional: 208, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 280, Positive conditional cache size: 25, Positive unconditional cache size: 255, Negative cache size: 41, Negative conditional cache size: 16, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 49 PlacesBefore, 43 PlacesAfterwards, 48 TransitionsBefore, 42 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 118, independent conditional: 38, independent unconditional: 80, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, independent: 118, independent conditional: 38, independent unconditional: 80, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, independent: 118, independent conditional: 38, independent unconditional: 80, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 119, independent: 101, independent conditional: 23, independent unconditional: 78, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 15, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 467, Positive conditional cache size: 41, Positive unconditional cache size: 426, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 56 PlacesBefore, 53 PlacesAfterwards, 59 TransitionsBefore, 56 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 15, independent unconditional: 23, 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: 38, independent: 38, independent conditional: 15, independent unconditional: 23, 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: 38, independent: 38, independent conditional: 15, independent unconditional: 23, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 38, independent: 28, independent conditional: 5, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 485, Positive conditional cache size: 51, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 62 PlacesBefore, 61 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 5, independent unconditional: 6, 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: 11, independent: 11, independent conditional: 5, independent unconditional: 6, 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: 11, independent: 11, independent conditional: 5, independent unconditional: 6, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 490, Positive conditional cache size: 56, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 71 PlacesBefore, 70 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 500, Positive conditional cache size: 66, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 75 PlacesBefore, 74 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 510, Positive conditional cache size: 76, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 97 PlacesBefore, 95 PlacesAfterwards, 114 TransitionsBefore, 112 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 562, Positive cache size: 520, Positive conditional cache size: 86, Positive unconditional cache size: 434, Negative cache size: 42, Negative conditional cache size: 16, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 120 PlacesBefore, 116 PlacesAfterwards, 157 TransitionsBefore, 153 TransitionsAfterwards, 1052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 555, Positive conditional cache size: 109, Positive unconditional cache size: 446, Negative cache size: 45, Negative conditional cache size: 19, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 166 PlacesBefore, 159 PlacesAfterwards, 279 TransitionsBefore, 272 TransitionsAfterwards, 1550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 64, independent conditional: 62, independent unconditional: 2, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 64, independent conditional: 62, independent unconditional: 2, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 38, independent conditional: 36, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 675, Positive cache size: 625, Positive conditional cache size: 135, Positive unconditional cache size: 490, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 162 PlacesBefore, 161 PlacesAfterwards, 304 TransitionsBefore, 303 TransitionsAfterwards, 1720 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 630, Positive conditional cache size: 140, Positive unconditional cache size: 490, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 174 PlacesBefore, 174 PlacesAfterwards, 350 TransitionsBefore, 350 TransitionsAfterwards, 2070 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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): 704, Positive cache size: 654, Positive conditional cache size: 140, Positive unconditional cache size: 514, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 216 PlacesBefore, 212 PlacesAfterwards, 427 TransitionsBefore, 423 TransitionsAfterwards, 2510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 60, independent: 60, independent conditional: 60, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 60, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 807, Positive cache size: 757, Positive conditional cache size: 167, Positive unconditional cache size: 590, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 245 PlacesBefore, 243 PlacesAfterwards, 597 TransitionsBefore, 595 TransitionsAfterwards, 3498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 61, independent conditional: 61, 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: 61, independent: 61, independent conditional: 55, independent unconditional: 6, 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: 61, independent: 61, independent conditional: 49, independent unconditional: 12, 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: 61, independent: 61, independent conditional: 49, independent unconditional: 12, 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: 19, independent: 19, independent conditional: 16, independent unconditional: 3, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 61, independent: 42, independent conditional: 33, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 16, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 889, Positive conditional cache size: 183, Positive unconditional cache size: 706, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 266 PlacesBefore, 265 PlacesAfterwards, 741 TransitionsBefore, 740 TransitionsAfterwards, 4310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 31, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 31, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 34, independent: 24, independent conditional: 21, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 980, Positive cache size: 930, Positive conditional cache size: 193, Positive unconditional cache size: 737, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 311 PlacesBefore, 310 PlacesAfterwards, 976 TransitionsBefore, 975 TransitionsAfterwards, 5684 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 28, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 938, Positive conditional cache size: 198, Positive unconditional cache size: 740, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 352 PlacesBefore, 349 PlacesAfterwards, 1348 TransitionsBefore, 1345 TransitionsAfterwards, 8024 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, 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: 51, independent: 51, independent conditional: 51, 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: 51, independent: 51, independent conditional: 51, 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: 51, independent: 51, independent conditional: 51, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 51, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1013, Positive cache size: 963, Positive conditional cache size: 206, Positive unconditional cache size: 757, Negative cache size: 50, Negative conditional cache size: 24, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 238 locations, 6 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: 838.7s, OverallIterations: 20, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 735.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 311 mSolverCounterUnknown, 5780 SdHoareTripleChecker+Valid, 531.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5780 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 524.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 501 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2669 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25622 IncrementalHoareTripleChecker+Invalid, 29103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2669 mSolverCounterUnsat, 1 mSDtfsCounter, 25622 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 945 GetRequests, 364 SyntacticMatches, 35 SemanticMatches, 546 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 6239 ImplicationChecksByTransitivity, 129.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45216occurred in iteration=19, InterpolantAutomatonStates: 301, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 56.9s InterpolantComputationTime, 571 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 765 ConstructedInterpolants, 35 QuantifiedInterpolants, 13652 SizeOfPredicates, 313 NumberOfNonLiveVariables, 3929 ConjunctsInSsa, 743 ConjunctsInUnsatCore, 46 InterpolantComputations, 8 PerfectInterpolantSequences, 65/372 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