/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:48:28,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:48:28,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:48:28,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:48:28,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:48:28,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:48:28,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:48:28,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:48:28,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:48:28,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:48:28,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:48:28,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:48:28,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:48:28,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:48:28,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:48:28,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:48:28,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:48:28,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:48:28,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:48:28,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:48:28,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:48:28,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:48:28,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:48:28,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:48:28,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:48:28,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:48:28,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:48:28,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:48:28,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:48:28,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:48:28,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:48:28,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:48:28,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:48:28,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:48:28,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:48:28,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:48:28,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:48:28,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:48:28,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:48:28,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:48:28,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:48:28,781 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-NoLbe.epf [2022-12-11 20:48:28,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:48:28,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:48:28,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:48:28,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:48:28,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:48:28,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:48:28,821 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:48:28,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:48:28,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:48:28,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:48:28,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:48:28,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:48:28,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:48:28,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:48:28,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:48:28,824 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:48:28,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:48:28,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:48:28,825 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:48:28,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 20:48:29,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:48:29,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:48:29,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:48:29,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:48:29,158 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:48:29,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-11 20:48:30,327 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:48:30,607 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:48:30,607 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-11 20:48:30,622 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80f7a64e/632bf173b82e48e5925212bb300d5efd/FLAG6d24f8540 [2022-12-11 20:48:30,635 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f80f7a64e/632bf173b82e48e5925212bb300d5efd [2022-12-11 20:48:30,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:48:30,639 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:48:30,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:48:30,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:48:30,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:48:30,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:48:30" (1/1) ... [2022-12-11 20:48:30,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44eeb0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:30, skipping insertion in model container [2022-12-11 20:48:30,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:48:30" (1/1) ... [2022-12-11 20:48:30,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:48:30,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:48:31,036 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_longer-2.i[41529,41542] [2022-12-11 20:48:31,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:48:31,075 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:48:31,105 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_longer-2.i[41529,41542] [2022-12-11 20:48:31,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:48:31,178 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:48:31,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31 WrapperNode [2022-12-11 20:48:31,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:48:31,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:48:31,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:48:31,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:48:31,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,250 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-11 20:48:31,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:48:31,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:48:31,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:48:31,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:48:31,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:48:31,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:48:31,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:48:31,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:48:31,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (1/1) ... [2022-12-11 20:48:31,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:48:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:48:31,332 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-11 20:48:31,363 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-11 20:48:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-11 20:48:31,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-11 20:48:31,375 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:48:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:48:31,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:48:31,377 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:48:31,571 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:48:31,573 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:48:31,766 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:48:31,773 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:48:31,774 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-11 20:48:31,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:48:31 BoogieIcfgContainer [2022-12-11 20:48:31,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:48:31,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:48:31,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:48:31,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:48:31,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:48:30" (1/3) ... [2022-12-11 20:48:31,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccde5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:48:31, skipping insertion in model container [2022-12-11 20:48:31,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:48:31" (2/3) ... [2022-12-11 20:48:31,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccde5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:48:31, skipping insertion in model container [2022-12-11 20:48:31,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:48:31" (3/3) ... [2022-12-11 20:48:31,783 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-11 20:48:31,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:48:31,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:48:31,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:48:31,915 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 20:48:31,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-11 20:48:32,035 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-11 20:48:32,035 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 20:48:32,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 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/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-11 20:48:32,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-11 20:48:32,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-11 20:48:32,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:48:32,075 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=PETRI_NET, 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;@6268ffad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:48:32,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 20:48:32,114 INFO L130 PetriNetUnfolder]: 5/117 cut-off events. [2022-12-11 20:48:32,115 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-11 20:48:32,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:32,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:32,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1550953799, now seen corresponding path program 1 times [2022-12-11 20:48:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201633349] [2022-12-11 20:48:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:32,487 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-11 20:48:32,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201633349] [2022-12-11 20:48:32,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201633349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:32,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:32,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 20:48:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989523695] [2022-12-11 20:48:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:32,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:48:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:32,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:48:32,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:48:32,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 150 [2022-12-11 20:48:32,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 139 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-11 20:48:32,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:32,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 150 [2022-12-11 20:48:32,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:32,694 INFO L130 PetriNetUnfolder]: 88/603 cut-off events. [2022-12-11 20:48:32,695 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-11 20:48:32,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 603 events. 88/603 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2671 event pairs, 32 based on Foata normal form. 70/609 useless extension candidates. Maximal degree in co-relation 663. Up to 111 conditions per place. [2022-12-11 20:48:32,705 INFO L137 encePairwiseOnDemand]: 140/150 looper letters, 20 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2022-12-11 20:48:32,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 335 flow [2022-12-11 20:48:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:48:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:48:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2022-12-11 20:48:32,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9177777777777778 [2022-12-11 20:48:32,723 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2022-12-11 20:48:32,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 137 transitions, 335 flow [2022-12-11 20:48:32,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 137 transitions, 335 flow [2022-12-11 20:48:32,731 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 335 flow [2022-12-11 20:48:32,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-11 20:48:32,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:32,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:32,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:48:32,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1885844005, now seen corresponding path program 1 times [2022-12-11 20:48:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78672577] [2022-12-11 20:48:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:32,967 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-11 20:48:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:32,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78672577] [2022-12-11 20:48:32,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78672577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:32,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:32,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 20:48:32,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753134083] [2022-12-11 20:48:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:32,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 20:48:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 20:48:32,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 20:48:32,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 150 [2022-12-11 20:48:32,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-11 20:48:32,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:32,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 150 [2022-12-11 20:48:32,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:33,138 INFO L130 PetriNetUnfolder]: 114/791 cut-off events. [2022-12-11 20:48:33,138 INFO L131 PetriNetUnfolder]: For 192/228 co-relation queries the response was YES. [2022-12-11 20:48:33,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 791 events. 114/791 cut-off events. For 192/228 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4110 event pairs, 38 based on Foata normal form. 6/717 useless extension candidates. Maximal degree in co-relation 911. Up to 140 conditions per place. [2022-12-11 20:48:33,147 INFO L137 encePairwiseOnDemand]: 145/150 looper letters, 19 selfloop transitions, 4 changer transitions 0/146 dead transitions. [2022-12-11 20:48:33,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 146 transitions, 419 flow [2022-12-11 20:48:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 20:48:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 20:48:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-12-11 20:48:33,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9016666666666666 [2022-12-11 20:48:33,153 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2022-12-11 20:48:33,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 146 transitions, 419 flow [2022-12-11 20:48:33,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 146 transitions, 419 flow [2022-12-11 20:48:33,161 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 146 transitions, 419 flow [2022-12-11 20:48:33,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-11 20:48:33,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:33,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:33,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:48:33,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash -610231768, now seen corresponding path program 1 times [2022-12-11 20:48:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:33,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259819615] [2022-12-11 20:48:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:33,297 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-11 20:48:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:33,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259819615] [2022-12-11 20:48:33,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259819615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:33,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:33,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 20:48:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623124353] [2022-12-11 20:48:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:33,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:48:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:33,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:48:33,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:48:33,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 150 [2022-12-11 20:48:33,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 146 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-11 20:48:33,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:33,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 150 [2022-12-11 20:48:33,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:33,483 INFO L130 PetriNetUnfolder]: 158/1120 cut-off events. [2022-12-11 20:48:33,483 INFO L131 PetriNetUnfolder]: For 446/536 co-relation queries the response was YES. [2022-12-11 20:48:33,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 1120 events. 158/1120 cut-off events. For 446/536 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6076 event pairs, 20 based on Foata normal form. 3/1016 useless extension candidates. Maximal degree in co-relation 1571. Up to 230 conditions per place. [2022-12-11 20:48:33,492 INFO L137 encePairwiseOnDemand]: 144/150 looper letters, 36 selfloop transitions, 4 changer transitions 0/159 dead transitions. [2022-12-11 20:48:33,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 159 transitions, 566 flow [2022-12-11 20:48:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:48:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:48:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2022-12-11 20:48:33,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2022-12-11 20:48:33,495 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 3 predicate places. [2022-12-11 20:48:33,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 159 transitions, 566 flow [2022-12-11 20:48:33,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 159 transitions, 566 flow [2022-12-11 20:48:33,500 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 159 transitions, 566 flow [2022-12-11 20:48:33,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-11 20:48:33,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:33,501 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:33,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:48:33,501 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:33,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2129724504, now seen corresponding path program 1 times [2022-12-11 20:48:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:33,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380000884] [2022-12-11 20:48:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:33,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:48:33,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:33,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380000884] [2022-12-11 20:48:33,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380000884] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:48:33,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553803571] [2022-12-11 20:48:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:33,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:48:33,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:48:33,710 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-11 20:48:33,711 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-11 20:48:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:33,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-11 20:48:33,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:48:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:48:34,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:48:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:48:34,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553803571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:48:34,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:48:34,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-11 20:48:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768569405] [2022-12-11 20:48:34,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:48:34,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 20:48:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:34,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 20:48:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-11 20:48:34,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 150 [2022-12-11 20:48:34,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 159 transitions, 566 flow. Second operand has 10 states, 10 states have (on average 126.5) internal successors, (1265), 10 states have internal predecessors, (1265), 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-11 20:48:34,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:34,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 150 [2022-12-11 20:48:34,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:34,621 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][169], [75#L945-2true, t1Thread1of1ForFork1InUse, 161#(<= 1 ~top~0), t2Thread1of1ForFork0InUse, 162#true, 29#L1010true, 153#true, 150#true, 23#L1022-4true]) [2022-12-11 20:48:34,622 INFO L382 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-12-11 20:48:34,622 INFO L385 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-12-11 20:48:34,622 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-11 20:48:34,622 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-11 20:48:34,622 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][170], [75#L945-2true, t1Thread1of1ForFork1InUse, t2Thread1of1ForFork0InUse, 135#L1008-1true, 191#(<= ~top~0 0), 159#true, 153#true, 150#true, 23#L1022-4true]) [2022-12-11 20:48:34,622 INFO L382 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-12-11 20:48:34,622 INFO L385 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-12-11 20:48:34,622 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-11 20:48:34,623 INFO L385 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-12-11 20:48:34,677 INFO L130 PetriNetUnfolder]: 423/2349 cut-off events. [2022-12-11 20:48:34,677 INFO L131 PetriNetUnfolder]: For 1573/1878 co-relation queries the response was YES. [2022-12-11 20:48:34,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 2349 events. 423/2349 cut-off events. For 1573/1878 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 16133 event pairs, 28 based on Foata normal form. 24/2152 useless extension candidates. Maximal degree in co-relation 4134. Up to 583 conditions per place. [2022-12-11 20:48:34,696 INFO L137 encePairwiseOnDemand]: 141/150 looper letters, 114 selfloop transitions, 47 changer transitions 2/280 dead transitions. [2022-12-11 20:48:34,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 280 transitions, 1634 flow [2022-12-11 20:48:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 20:48:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 20:48:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2363 transitions. [2022-12-11 20:48:34,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8751851851851852 [2022-12-11 20:48:34,703 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2022-12-11 20:48:34,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 280 transitions, 1634 flow [2022-12-11 20:48:34,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 278 transitions, 1608 flow [2022-12-11 20:48:34,715 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 278 transitions, 1608 flow [2022-12-11 20:48:34,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.5) internal successors, (1265), 10 states have internal predecessors, (1265), 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-11 20:48:34,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:34,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:34,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-11 20:48:34,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:48:34,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:34,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 9991586, now seen corresponding path program 1 times [2022-12-11 20:48:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:34,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155126691] [2022-12-11 20:48:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:35,094 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-11 20:48:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:35,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155126691] [2022-12-11 20:48:35,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155126691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:35,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:35,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 20:48:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519481150] [2022-12-11 20:48:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:35,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:48:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:48:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:48:35,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 150 [2022-12-11 20:48:35,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 278 transitions, 1608 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-11 20:48:35,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:35,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 150 [2022-12-11 20:48:35,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:35,230 INFO L130 PetriNetUnfolder]: 121/1007 cut-off events. [2022-12-11 20:48:35,230 INFO L131 PetriNetUnfolder]: For 1554/1554 co-relation queries the response was YES. [2022-12-11 20:48:35,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1007 events. 121/1007 cut-off events. For 1554/1554 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5152 event pairs, 1 based on Foata normal form. 18/965 useless extension candidates. Maximal degree in co-relation 1691. Up to 199 conditions per place. [2022-12-11 20:48:35,237 INFO L137 encePairwiseOnDemand]: 146/150 looper letters, 43 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2022-12-11 20:48:35,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 206 transitions, 1224 flow [2022-12-11 20:48:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:48:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:48:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-12-11 20:48:35,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2022-12-11 20:48:35,241 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 14 predicate places. [2022-12-11 20:48:35,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 206 transitions, 1224 flow [2022-12-11 20:48:35,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 206 transitions, 1224 flow [2022-12-11 20:48:35,246 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 206 transitions, 1224 flow [2022-12-11 20:48:35,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-11 20:48:35,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:35,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:48:35,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash -150902762, now seen corresponding path program 1 times [2022-12-11 20:48:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:35,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690240730] [2022-12-11 20:48:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:36,778 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-11 20:48:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:36,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690240730] [2022-12-11 20:48:36,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690240730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:36,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:36,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-12-11 20:48:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207088306] [2022-12-11 20:48:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:36,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-11 20:48:36,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-11 20:48:36,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-12-11 20:48:36,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 150 [2022-12-11 20:48:36,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 206 transitions, 1224 flow. Second operand has 25 states, 25 states have (on average 77.28) internal successors, (1932), 25 states have internal predecessors, (1932), 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-11 20:48:36,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:36,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 150 [2022-12-11 20:48:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:39,049 INFO L130 PetriNetUnfolder]: 1168/3962 cut-off events. [2022-12-11 20:48:39,049 INFO L131 PetriNetUnfolder]: For 7375/7377 co-relation queries the response was YES. [2022-12-11 20:48:39,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10450 conditions, 3962 events. 1168/3962 cut-off events. For 7375/7377 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 29398 event pairs, 88 based on Foata normal form. 1/3739 useless extension candidates. Maximal degree in co-relation 8082. Up to 1507 conditions per place. [2022-12-11 20:48:39,078 INFO L137 encePairwiseOnDemand]: 116/150 looper letters, 344 selfloop transitions, 42 changer transitions 2/455 dead transitions. [2022-12-11 20:48:39,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 455 transitions, 3470 flow [2022-12-11 20:48:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-11 20:48:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-11 20:48:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2589 transitions. [2022-12-11 20:48:39,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5567741935483871 [2022-12-11 20:48:39,085 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 44 predicate places. [2022-12-11 20:48:39,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 455 transitions, 3470 flow [2022-12-11 20:48:39,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 453 transitions, 3462 flow [2022-12-11 20:48:39,101 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 453 transitions, 3462 flow [2022-12-11 20:48:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 77.28) internal successors, (1932), 25 states have internal predecessors, (1932), 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-11 20:48:39,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:39,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:48:39,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1433257340, now seen corresponding path program 2 times [2022-12-11 20:48:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:39,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994336545] [2022-12-11 20:48:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:40,642 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-11 20:48:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:40,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994336545] [2022-12-11 20:48:40,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994336545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:40,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:40,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-12-11 20:48:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545849439] [2022-12-11 20:48:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:40,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-11 20:48:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:40,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-11 20:48:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2022-12-11 20:48:40,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 150 [2022-12-11 20:48:40,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 453 transitions, 3462 flow. Second operand has 31 states, 31 states have (on average 65.09677419354838) internal successors, (2018), 31 states have internal predecessors, (2018), 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-11 20:48:40,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:40,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 150 [2022-12-11 20:48:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:43,734 INFO L130 PetriNetUnfolder]: 1547/5349 cut-off events. [2022-12-11 20:48:43,734 INFO L131 PetriNetUnfolder]: For 10806/10842 co-relation queries the response was YES. [2022-12-11 20:48:43,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17517 conditions, 5349 events. 1547/5349 cut-off events. For 10806/10842 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 43403 event pairs, 210 based on Foata normal form. 3/5064 useless extension candidates. Maximal degree in co-relation 13481. Up to 2443 conditions per place. [2022-12-11 20:48:43,780 INFO L137 encePairwiseOnDemand]: 114/150 looper letters, 527 selfloop transitions, 61 changer transitions 3/650 dead transitions. [2022-12-11 20:48:43,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 650 transitions, 6273 flow [2022-12-11 20:48:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-11 20:48:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-11 20:48:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2410 transitions. [2022-12-11 20:48:43,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4725490196078431 [2022-12-11 20:48:43,787 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 77 predicate places. [2022-12-11 20:48:43,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 650 transitions, 6273 flow [2022-12-11 20:48:43,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 647 transitions, 6255 flow [2022-12-11 20:48:43,814 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 647 transitions, 6255 flow [2022-12-11 20:48:43,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 65.09677419354838) internal successors, (2018), 31 states have internal predecessors, (2018), 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-11 20:48:43,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:43,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:43,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:48:43,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash 856298386, now seen corresponding path program 3 times [2022-12-11 20:48:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:43,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375707984] [2022-12-11 20:48:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:45,314 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-11 20:48:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375707984] [2022-12-11 20:48:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375707984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:45,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:48:45,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-12-11 20:48:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025222410] [2022-12-11 20:48:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:45,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-11 20:48:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:45,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-11 20:48:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-12-11 20:48:45,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 150 [2022-12-11 20:48:45,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 647 transitions, 6255 flow. Second operand has 31 states, 31 states have (on average 65.09677419354838) internal successors, (2018), 31 states have internal predecessors, (2018), 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-11 20:48:45,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:45,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 150 [2022-12-11 20:48:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:48,460 INFO L130 PetriNetUnfolder]: 1878/6502 cut-off events. [2022-12-11 20:48:48,460 INFO L131 PetriNetUnfolder]: For 15021/15170 co-relation queries the response was YES. [2022-12-11 20:48:48,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25586 conditions, 6502 events. 1878/6502 cut-off events. For 15021/15170 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 56106 event pairs, 122 based on Foata normal form. 10/6159 useless extension candidates. Maximal degree in co-relation 19565. Up to 3250 conditions per place. [2022-12-11 20:48:48,499 INFO L137 encePairwiseOnDemand]: 115/150 looper letters, 694 selfloop transitions, 78 changer transitions 3/834 dead transitions. [2022-12-11 20:48:48,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 834 transitions, 9688 flow [2022-12-11 20:48:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-11 20:48:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-11 20:48:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2410 transitions. [2022-12-11 20:48:48,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4725490196078431 [2022-12-11 20:48:48,505 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 110 predicate places. [2022-12-11 20:48:48,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 834 transitions, 9688 flow [2022-12-11 20:48:48,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 831 transitions, 9664 flow [2022-12-11 20:48:48,535 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 831 transitions, 9664 flow [2022-12-11 20:48:48,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 65.09677419354838) internal successors, (2018), 31 states have internal predecessors, (2018), 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-11 20:48:48,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:48,537 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:48,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:48:48,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:48,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1195959402, now seen corresponding path program 1 times [2022-12-11 20:48:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:48,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626380343] [2022-12-11 20:48:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:48:48,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:48,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626380343] [2022-12-11 20:48:48,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626380343] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:48:48,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377364186] [2022-12-11 20:48:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:48,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:48:48,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:48:48,692 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-11 20:48:48,698 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-11 20:48:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:48,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 20:48:48,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:48:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-11 20:48:48,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 20:48:48,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377364186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:48:48,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 20:48:48,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-12-11 20:48:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851162078] [2022-12-11 20:48:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:48,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:48:48,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:48,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:48:48,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:48:48,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 150 [2022-12-11 20:48:48,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 831 transitions, 9664 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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-11 20:48:48,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:48,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 150 [2022-12-11 20:48:48,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:48:50,198 INFO L130 PetriNetUnfolder]: 1970/6889 cut-off events. [2022-12-11 20:48:50,198 INFO L131 PetriNetUnfolder]: For 20246/20340 co-relation queries the response was YES. [2022-12-11 20:48:50,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28460 conditions, 6889 events. 1970/6889 cut-off events. For 20246/20340 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 58316 event pairs, 153 based on Foata normal form. 1/6563 useless extension candidates. Maximal degree in co-relation 21559. Up to 3512 conditions per place. [2022-12-11 20:48:50,246 INFO L137 encePairwiseOnDemand]: 140/150 looper letters, 320 selfloop transitions, 73 changer transitions 86/859 dead transitions. [2022-12-11 20:48:50,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 859 transitions, 10946 flow [2022-12-11 20:48:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 20:48:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 20:48:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1026 transitions. [2022-12-11 20:48:50,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.855 [2022-12-11 20:48:50,249 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 117 predicate places. [2022-12-11 20:48:50,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 859 transitions, 10946 flow [2022-12-11 20:48:50,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 773 transitions, 9538 flow [2022-12-11 20:48:50,282 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 773 transitions, 9538 flow [2022-12-11 20:48:50,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 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-11 20:48:50,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:48:50,283 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:48:50,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-11 20:48:50,488 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-11 20:48:50,489 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:48:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:48:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1422429968, now seen corresponding path program 1 times [2022-12-11 20:48:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:48:50,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717234596] [2022-12-11 20:48:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:48:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-11 20:48:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:48:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717234596] [2022-12-11 20:48:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717234596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:48:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191985432] [2022-12-11 20:48:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:48:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:48:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:48:51,585 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-11 20:48:51,649 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-11 20:48:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:48:51,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-11 20:48:51,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:48:52,791 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 19 treesize of output 15 [2022-12-11 20:48:53,666 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 41 treesize of output 21 [2022-12-11 20:48:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:48:53,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:48:54,363 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 54 treesize of output 46 [2022-12-11 20:48:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-11 20:48:54,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191985432] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 20:48:54,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 20:48:54,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [23, 26] total 66 [2022-12-11 20:48:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705676836] [2022-12-11 20:48:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:48:54,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-11 20:48:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:48:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-11 20:48:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4050, Unknown=0, NotChecked=0, Total=4290 [2022-12-11 20:48:54,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 150 [2022-12-11 20:48:54,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 773 transitions, 9538 flow. Second operand has 22 states, 22 states have (on average 78.45454545454545) internal successors, (1726), 22 states have internal predecessors, (1726), 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-11 20:48:54,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:48:54,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 150 [2022-12-11 20:48:54,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:49:00,957 INFO L130 PetriNetUnfolder]: 2567/9148 cut-off events. [2022-12-11 20:49:00,957 INFO L131 PetriNetUnfolder]: For 29458/29618 co-relation queries the response was YES. [2022-12-11 20:49:00,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44079 conditions, 9148 events. 2567/9148 cut-off events. For 29458/29618 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 82331 event pairs, 125 based on Foata normal form. 3/8696 useless extension candidates. Maximal degree in co-relation 35456. Up to 5094 conditions per place. [2022-12-11 20:49:01,047 INFO L137 encePairwiseOnDemand]: 115/150 looper letters, 838 selfloop transitions, 378 changer transitions 55/1338 dead transitions. [2022-12-11 20:49:01,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 1338 transitions, 20313 flow [2022-12-11 20:49:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-11 20:49:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-12-11 20:49:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 5275 transitions. [2022-12-11 20:49:01,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5328282828282829 [2022-12-11 20:49:01,056 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 182 predicate places. [2022-12-11 20:49:01,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 1338 transitions, 20313 flow [2022-12-11 20:49:01,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 1283 transitions, 18983 flow [2022-12-11 20:49:01,125 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 1283 transitions, 18983 flow [2022-12-11 20:49:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 78.45454545454545) internal successors, (1726), 22 states have internal predecessors, (1726), 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-11 20:49:01,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:49:01,126 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:49:01,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-11 20:49:01,332 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-11 20:49:01,333 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:49:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:49:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2132543818, now seen corresponding path program 2 times [2022-12-11 20:49:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:49:01,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687426369] [2022-12-11 20:49:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:49:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:49:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:49:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:49:03,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687426369] [2022-12-11 20:49:03,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687426369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:49:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673020193] [2022-12-11 20:49:03,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 20:49:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:49:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:49:03,060 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-11 20:49:03,061 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-11 20:49:03,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 20:49:03,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:49:03,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-11 20:49:03,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:49:03,233 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-11 20:49:03,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-11 20:49:03,259 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 20:49:03,260 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 11 treesize of output 11 [2022-12-11 20:49:03,892 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 19 treesize of output 15 [2022-12-11 20:49:03,985 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 56 treesize of output 52 [2022-12-11 20:49:04,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 61 treesize of output 21 [2022-12-11 20:49:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-11 20:49:04,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:49:05,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 20:49:05,732 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-11 20:49:05,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 20:49:05,748 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 52 [2022-12-11 20:49:05,753 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-11 20:49:06,607 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-11 20:49:06,608 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 13 treesize of output 12 [2022-12-11 20:49:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-11 20:49:06,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673020193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:49:06,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:49:06,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 75 [2022-12-11 20:49:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527627206] [2022-12-11 20:49:06,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:49:06,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-11 20:49:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:49:06,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-11 20:49:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=5292, Unknown=10, NotChecked=0, Total=5550 [2022-12-11 20:49:06,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 150 [2022-12-11 20:49:06,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 1283 transitions, 18983 flow. Second operand has 75 states, 75 states have (on average 67.18666666666667) internal successors, (5039), 75 states have internal predecessors, (5039), 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-11 20:49:06,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:49:06,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 150 [2022-12-11 20:49:06,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:49:26,550 INFO L130 PetriNetUnfolder]: 2880/10429 cut-off events. [2022-12-11 20:49:26,550 INFO L131 PetriNetUnfolder]: For 36788/37047 co-relation queries the response was YES. [2022-12-11 20:49:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56843 conditions, 10429 events. 2880/10429 cut-off events. For 36788/37047 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 98171 event pairs, 70 based on Foata normal form. 18/9977 useless extension candidates. Maximal degree in co-relation 46402. Up to 5972 conditions per place. [2022-12-11 20:49:26,625 INFO L137 encePairwiseOnDemand]: 112/150 looper letters, 1040 selfloop transitions, 473 changer transitions 1/1573 dead transitions. [2022-12-11 20:49:26,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1573 transitions, 26550 flow [2022-12-11 20:49:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-11 20:49:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-12-11 20:49:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5341 transitions. [2022-12-11 20:49:26,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4564957264957265 [2022-12-11 20:49:26,634 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 259 predicate places. [2022-12-11 20:49:26,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 395 places, 1573 transitions, 26550 flow [2022-12-11 20:49:26,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 1572 transitions, 26538 flow [2022-12-11 20:49:26,697 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 1572 transitions, 26538 flow [2022-12-11 20:49:26,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 67.18666666666667) internal successors, (5039), 75 states have internal predecessors, (5039), 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-11 20:49:26,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:49:26,699 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:49:26,711 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-11 20:49:26,904 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-11 20:49:26,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:49:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:49:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash -986245600, now seen corresponding path program 2 times [2022-12-11 20:49:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:49:26,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913013492] [2022-12-11 20:49:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:49:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:49:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:49:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 9 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:49:27,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913013492] [2022-12-11 20:49:27,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913013492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:49:27,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752875649] [2022-12-11 20:49:27,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 20:49:27,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:49:27,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:49:27,087 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-11 20:49:27,089 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-11 20:49:27,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 20:49:27,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:49:27,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-11 20:49:27,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:49:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 9 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:27,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:49:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 9 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:27,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752875649] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:49:27,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:49:27,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-11 20:49:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196437342] [2022-12-11 20:49:27,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:49:27,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 20:49:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:49:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 20:49:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-11 20:49:27,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 150 [2022-12-11 20:49:27,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1572 transitions, 26538 flow. Second operand has 18 states, 18 states have (on average 126.72222222222223) internal successors, (2281), 18 states have internal predecessors, (2281), 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-11 20:49:27,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:49:27,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 150 [2022-12-11 20:49:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:49:32,007 INFO L130 PetriNetUnfolder]: 4457/15693 cut-off events. [2022-12-11 20:49:32,007 INFO L131 PetriNetUnfolder]: For 73554/73931 co-relation queries the response was YES. [2022-12-11 20:49:32,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90617 conditions, 15693 events. 4457/15693 cut-off events. For 73554/73931 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 141630 event pairs, 99 based on Foata normal form. 8/15008 useless extension candidates. Maximal degree in co-relation 73360. Up to 9335 conditions per place. [2022-12-11 20:49:32,102 INFO L137 encePairwiseOnDemand]: 143/150 looper letters, 1078 selfloop transitions, 239 changer transitions 0/2100 dead transitions. [2022-12-11 20:49:32,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 2100 transitions, 41368 flow [2022-12-11 20:49:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-11 20:49:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-11 20:49:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3102 transitions. [2022-12-11 20:49:32,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8616666666666667 [2022-12-11 20:49:32,106 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 282 predicate places. [2022-12-11 20:49:32,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 418 places, 2100 transitions, 41368 flow [2022-12-11 20:49:32,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 2100 transitions, 41368 flow [2022-12-11 20:49:32,180 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 2100 transitions, 41368 flow [2022-12-11 20:49:32,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 126.72222222222223) internal successors, (2281), 18 states have internal predecessors, (2281), 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-11 20:49:32,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:49:32,180 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:49:32,187 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-11 20:49:32,381 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-11 20:49:32,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:49:32,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:49:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1164614352, now seen corresponding path program 2 times [2022-12-11 20:49:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:49:32,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398577746] [2022-12-11 20:49:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:49:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:49:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:49:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-11 20:49:32,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:49:32,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398577746] [2022-12-11 20:49:32,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398577746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:49:32,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70657639] [2022-12-11 20:49:32,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 20:49:32,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:49:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:49:32,537 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-11 20:49:32,540 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-11 20:49:32,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 20:49:32,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:49:32,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-11 20:49:32,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:49:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-11 20:49:32,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:49:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-11 20:49:33,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70657639] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:49:33,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:49:33,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-11 20:49:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257026993] [2022-12-11 20:49:33,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:49:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 20:49:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:49:33,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 20:49:33,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-11 20:49:33,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 150 [2022-12-11 20:49:33,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 2100 transitions, 41368 flow. Second operand has 16 states, 16 states have (on average 125.375) internal successors, (2006), 16 states have internal predecessors, (2006), 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-11 20:49:33,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:49:33,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 150 [2022-12-11 20:49:33,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:49:38,739 INFO L130 PetriNetUnfolder]: 4951/17168 cut-off events. [2022-12-11 20:49:38,739 INFO L131 PetriNetUnfolder]: For 99144/99665 co-relation queries the response was YES. [2022-12-11 20:49:38,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103408 conditions, 17168 events. 4951/17168 cut-off events. For 99144/99665 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 157682 event pairs, 104 based on Foata normal form. 8/16406 useless extension candidates. Maximal degree in co-relation 81062. Up to 10415 conditions per place. [2022-12-11 20:49:38,837 INFO L137 encePairwiseOnDemand]: 140/150 looper letters, 1084 selfloop transitions, 411 changer transitions 0/2263 dead transitions. [2022-12-11 20:49:38,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 2263 transitions, 48434 flow [2022-12-11 20:49:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-11 20:49:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-11 20:49:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2773 transitions. [2022-12-11 20:49:38,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8403030303030303 [2022-12-11 20:49:38,840 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 303 predicate places. [2022-12-11 20:49:38,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 439 places, 2263 transitions, 48434 flow [2022-12-11 20:49:38,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 2263 transitions, 48434 flow [2022-12-11 20:49:38,917 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 2263 transitions, 48434 flow [2022-12-11 20:49:38,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 125.375) internal successors, (2006), 16 states have internal predecessors, (2006), 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-11 20:49:38,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:49:38,918 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:49:38,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 20:49:39,123 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-11 20:49:39,123 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:49:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:49:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1307075951, now seen corresponding path program 1 times [2022-12-11 20:49:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:49:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982473783] [2022-12-11 20:49:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:49:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:49:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:49:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:49:41,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982473783] [2022-12-11 20:49:41,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982473783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:49:41,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212062818] [2022-12-11 20:49:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:49:41,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:49:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:49:41,280 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-11 20:49:41,283 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-11 20:49:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:49:41,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-11 20:49:41,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:49:42,044 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 19 treesize of output 15 [2022-12-11 20:49:42,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2022-12-11 20:49:48,342 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-11 20:49:48,342 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 65 treesize of output 24 [2022-12-11 20:49:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:48,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:49:53,703 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 57 treesize of output 48 [2022-12-11 20:49:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:49:54,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212062818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:49:54,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:49:54,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 32] total 96 [2022-12-11 20:49:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160847073] [2022-12-11 20:49:54,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:49:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-12-11 20:49:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:49:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-12-11 20:49:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=8444, Unknown=2, NotChecked=0, Total=9120 [2022-12-11 20:49:54,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 150 [2022-12-11 20:49:54,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 2263 transitions, 48434 flow. Second operand has 96 states, 96 states have (on average 78.02083333333333) internal successors, (7490), 96 states have internal predecessors, (7490), 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-11 20:49:54,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:49:54,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 150 [2022-12-11 20:49:54,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:22,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-11 20:50:53,629 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-11 20:51:18,765 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-11 20:51:53,535 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-11 20:52:08,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-11 20:52:11,664 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-11 20:52:13,677 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-11 20:53:06,003 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 20:53:09,294 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-11 20:53:56,282 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-11 20:54:05,387 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-11 20:54:44,095 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-11 20:55:05,193 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 160 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 20:55:30,563 INFO L130 PetriNetUnfolder]: 9495/34681 cut-off events. [2022-12-11 20:55:30,563 INFO L131 PetriNetUnfolder]: For 192830/193791 co-relation queries the response was YES. [2022-12-11 20:55:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222098 conditions, 34681 events. 9495/34681 cut-off events. For 192830/193791 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 372283 event pairs, 151 based on Foata normal form. 34/33157 useless extension candidates. Maximal degree in co-relation 174287. Up to 21367 conditions per place. [2022-12-11 20:55:30,802 INFO L137 encePairwiseOnDemand]: 110/150 looper letters, 5132 selfloop transitions, 1502 changer transitions 611/7312 dead transitions. [2022-12-11 20:55:30,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 7312 transitions, 142968 flow [2022-12-11 20:55:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 520 states. [2022-12-11 20:55:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2022-12-11 20:55:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 41141 transitions. [2022-12-11 20:55:30,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.527448717948718 [2022-12-11 20:55:30,842 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 822 predicate places. [2022-12-11 20:55:30,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 958 places, 7312 transitions, 142968 flow [2022-12-11 20:55:31,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 940 places, 6701 transitions, 127384 flow [2022-12-11 20:55:31,041 INFO L495 AbstractCegarLoop]: Abstraction has has 940 places, 6701 transitions, 127384 flow [2022-12-11 20:55:31,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 78.02083333333333) internal successors, (7490), 96 states have internal predecessors, (7490), 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-11 20:55:31,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:31,044 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:31,051 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-11 20:55:31,244 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-11 20:55:31,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:31,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1364697881, now seen corresponding path program 2 times [2022-12-11 20:55:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:31,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484952706] [2022-12-11 20:55:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:55:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:33,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484952706] [2022-12-11 20:55:33,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484952706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:55:33,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442303924] [2022-12-11 20:55:33,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 20:55:33,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:55:33,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:55:33,456 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-11 20:55:33,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-11 20:55:33,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 20:55:33,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:55:33,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-11 20:55:33,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:55:33,695 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-11 20:55:33,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-11 20:55:33,717 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 20:55:33,717 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 11 treesize of output 11 [2022-12-11 20:55:34,700 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 19 treesize of output 15 [2022-12-11 20:55:34,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 20:55:34,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-12-11 20:55:35,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 20:55:35,804 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 49 treesize of output 36 [2022-12-11 20:55:37,285 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 41 treesize of output 21 [2022-12-11 20:55:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:55:37,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:55:39,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 20:55:39,316 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-11 20:55:39,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 20:55:39,328 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 52 [2022-12-11 20:55:39,332 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-11 20:55:40,370 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-11 20:55:40,371 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 13 treesize of output 12 [2022-12-11 20:55:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:55:40,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442303924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:55:40,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:55:40,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 34] total 96 [2022-12-11 20:55:40,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946665554] [2022-12-11 20:55:40,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:55:40,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-12-11 20:55:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:40,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-12-11 20:55:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=8492, Unknown=1, NotChecked=0, Total=9120 [2022-12-11 20:55:40,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 150 [2022-12-11 20:55:40,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 6701 transitions, 127384 flow. Second operand has 96 states, 96 states have (on average 66.10416666666667) internal successors, (6346), 96 states have internal predecessors, (6346), 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-11 20:55:40,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:40,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 150 [2022-12-11 20:55:40,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:59,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 [1] [2022-12-11 20:57:12,561 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-11 20:57:14,587 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-11 20:57:44,735 WARN L233 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 113 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 20:57:51,455 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-11 20:57:53,475 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-11 20:58:33,588 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-11 20:58:51,579 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-11 20:59:44,632 WARN L233 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 141 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 21:00:16,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 21:00:28,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 [1] [2022-12-11 21:00:30,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 21:00:39,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 [1] [2022-12-11 21:00:42,263 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-11 21:01:02,308 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 140 DAG size of output: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 21:01:12,114 WARN L233 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 155 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 21:01:33,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-11 21:02:11,081 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-11 21:02:11,081 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 21:02:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2022-12-11 21:02:11,198 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 21:02:11,204 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-11 21:02:11,398 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-11 21:02:11,399 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (96states, 63/150 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 274285 conditions, 39379 events (10246/39378 cut-off events. For 235128/236130 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 482151 event pairs, 124 based on Foata normal form. 35/38356 useless extension candidates. Maximal degree in co-relation 226902. Up to 24667 conditions per place.). [2022-12-11 21:02:11,400 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-11 21:02:11,400 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 21:02:11,400 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-11 21:02:11,401 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-11 21:02:11,401 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 21:02:11,401 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-11 21:02:11,405 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:02:11,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:02:11,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:02:11 BasicIcfg [2022-12-11 21:02:11,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:02:11,411 INFO L158 Benchmark]: Toolchain (without parser) took 820772.01ms. Allocated memory was 255.9MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 230.0MB in the beginning and 1.1GB in the end (delta: -838.3MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-11 21:02:11,411 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 255.9MB. Free memory is still 232.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:02:11,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.46ms. Allocated memory is still 255.9MB. Free memory was 230.0MB in the beginning and 200.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 21:02:11,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.56ms. Allocated memory is still 255.9MB. Free memory was 200.7MB in the beginning and 198.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:02:11,415 INFO L158 Benchmark]: Boogie Preprocessor took 48.12ms. Allocated memory is still 255.9MB. Free memory was 198.0MB in the beginning and 196.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:02:11,416 INFO L158 Benchmark]: RCFGBuilder took 475.91ms. Allocated memory is still 255.9MB. Free memory was 196.5MB in the beginning and 178.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-11 21:02:11,416 INFO L158 Benchmark]: TraceAbstraction took 819632.30ms. Allocated memory was 255.9MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 177.1MB in the beginning and 1.1GB in the end (delta: -891.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-11 21:02:11,417 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.14ms. Allocated memory is still 255.9MB. Free memory is still 232.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.46ms. Allocated memory is still 255.9MB. Free memory was 230.0MB in the beginning and 200.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.56ms. Allocated memory is still 255.9MB. Free memory was 200.7MB in the beginning and 198.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.12ms. Allocated memory is still 255.9MB. Free memory was 198.0MB in the beginning and 196.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 475.91ms. Allocated memory is still 255.9MB. Free memory was 196.5MB in the beginning and 178.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 819632.30ms. Allocated memory was 255.9MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 177.1MB in the beginning and 1.1GB in the end (delta: -891.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (96states, 63/150 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 274285 conditions, 39379 events (10246/39378 cut-off events. For 235128/236130 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 482151 event pairs, 124 based on Foata normal form. 35/38356 useless extension candidates. Maximal degree in co-relation 226902. Up to 24667 conditions per place.). - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (96states, 63/150 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 274285 conditions, 39379 events (10246/39378 cut-off events. For 235128/236130 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 482151 event pairs, 124 based on Foata normal form. 35/38356 useless extension candidates. Maximal degree in co-relation 226902. Up to 24667 conditions per place.). - 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (96states, 63/150 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 274285 conditions, 39379 events (10246/39378 cut-off events. For 235128/236130 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 482151 event pairs, 124 based on Foata normal form. 35/38356 useless extension candidates. Maximal degree in co-relation 226902. Up to 24667 conditions per place.). - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (96states, 63/150 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 274285 conditions, 39379 events (10246/39378 cut-off events. For 235128/236130 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 482151 event pairs, 124 based on Foata normal form. 35/38356 useless extension candidates. Maximal degree in co-relation 226902. Up to 24667 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 234 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.6s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 819.5s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 774.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 173 mSolverCounterUnknown, 14502 SdHoareTripleChecker+Valid, 89.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14502 mSDsluCounter, 15760 SdHoareTripleChecker+Invalid, 85.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15142 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46158 IncrementalHoareTripleChecker+Invalid, 46999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 618 mSDtfsCounter, 46158 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3446 GetRequests, 1923 SyntacticMatches, 14 SemanticMatches, 1509 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216986 ImplicationChecksByTransitivity, 626.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127384occurred in iteration=14, InterpolantAutomatonStates: 848, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 18410 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 40.6s InterpolantComputationTime, 2802 NumberOfCodeBlocks, 2768 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3759 ConstructedInterpolants, 134 QuantifiedInterpolants, 47117 SizeOfPredicates, 168 NumberOfNonLiveVariables, 2558 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 234/1284 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