/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:19:07,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:19:07,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:19:07,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:19:07,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:19:07,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:19:07,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:19:07,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:19:07,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:19:07,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:19:07,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:19:07,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:19:07,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:19:07,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:19:07,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:19:07,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:19:07,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:19:07,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:19:07,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:19:07,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:19:07,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:19:07,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:19:07,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:19:07,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:19:07,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:19:07,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:19:07,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:19:07,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:19:07,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:19:07,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:19:07,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:19:07,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:19:07,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:19:07,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:19:07,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:19:07,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:19:07,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:19:07,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:19:07,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:19:07,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:19:07,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:19:07,650 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-SemanticLbe.epf [2022-12-12 18:19:07,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:19:07,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:19:07,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:19:07,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:19:07,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:19:07,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:19:07,666 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:19:07,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:19:07,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:19:07,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:19:07,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:19:07,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:19:07,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:19:07,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:19:07,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:19:07,669 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-12 18:19:07,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:19:07,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:19:07,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:19:07,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:19:07,998 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:19:08,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-12-12 18:19:08,964 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:19:09,177 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:19:09,177 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-12-12 18:19:09,189 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a741f5c/8a53963b237c412ba349d4db3ebfd708/FLAG57b401376 [2022-12-12 18:19:09,201 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a741f5c/8a53963b237c412ba349d4db3ebfd708 [2022-12-12 18:19:09,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:19:09,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:19:09,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:19:09,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:19:09,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:19:09,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525076b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09, skipping insertion in model container [2022-12-12 18:19:09,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:19:09,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:19:09,482 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-12-12 18:19:09,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:19:09,517 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:19:09,538 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-12-12 18:19:09,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:19:09,593 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:19:09,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09 WrapperNode [2022-12-12 18:19:09,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:19:09,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:19:09,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:19:09,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:19:09,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,639 INFO L138 Inliner]: procedures = 277, calls = 43, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 152 [2022-12-12 18:19:09,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:19:09,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:19:09,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:19:09,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:19:09,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,668 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:19:09,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:19:09,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:19:09,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:19:09,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (1/1) ... [2022-12-12 18:19:09,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:19:09,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:19:09,704 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-12 18:19:09,742 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-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 18:19:09,765 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 18:19:09,765 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:19:09,765 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 18:19:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:19:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:19:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:19:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:19:09,767 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:19:09,872 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:19:09,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:19:10,056 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:19:10,069 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:19:10,069 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 18:19:10,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:19:10 BoogieIcfgContainer [2022-12-12 18:19:10,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:19:10,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:19:10,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:19:10,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:19:10,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:19:09" (1/3) ... [2022-12-12 18:19:10,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463fec0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:19:10, skipping insertion in model container [2022-12-12 18:19:10,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:19:09" (2/3) ... [2022-12-12 18:19:10,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463fec0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:19:10, skipping insertion in model container [2022-12-12 18:19:10,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:19:10" (3/3) ... [2022-12-12 18:19:10,082 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-12-12 18:19:10,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:19:10,095 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:19:10,095 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:19:10,154 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 18:19:10,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 154 transitions, 324 flow [2022-12-12 18:19:10,269 INFO L130 PetriNetUnfolder]: 10/152 cut-off events. [2022-12-12 18:19:10,269 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 18:19:10,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 10/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-12 18:19:10,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 154 transitions, 324 flow [2022-12-12 18:19:10,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 143 transitions, 295 flow [2022-12-12 18:19:10,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:19:10,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-12 18:19:10,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 143 transitions, 295 flow [2022-12-12 18:19:10,363 INFO L130 PetriNetUnfolder]: 10/143 cut-off events. [2022-12-12 18:19:10,363 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 18:19:10,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 143 events. 10/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 310 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-12 18:19:10,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 143 transitions, 295 flow [2022-12-12 18:19:10,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-12 18:19:15,100 INFO L241 LiptonReduction]: Total number of compositions: 120 [2022-12-12 18:19:15,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:19:15,129 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;@df5efcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:19:15,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:19:15,136 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-12 18:19:15,136 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 18:19:15,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:15,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-12 18:19:15,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2126127621, now seen corresponding path program 1 times [2022-12-12 18:19:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:15,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529744223] [2022-12-12 18:19:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:15,345 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-12 18:19:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:15,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529744223] [2022-12-12 18:19:15,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529744223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:15,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:15,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:19:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009724793] [2022-12-12 18:19:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:15,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:19:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:19:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:19:15,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 110 [2022-12-12 18:19:15,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-12 18:19:15,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:15,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 110 [2022-12-12 18:19:15,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:16,576 INFO L130 PetriNetUnfolder]: 12154/20272 cut-off events. [2022-12-12 18:19:16,577 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-12-12 18:19:16,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40006 conditions, 20272 events. 12154/20272 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 148337 event pairs, 5818 based on Foata normal form. 0/6575 useless extension candidates. Maximal degree in co-relation 39439. Up to 12881 conditions per place. [2022-12-12 18:19:16,632 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 148 selfloop transitions, 9 changer transitions 2/170 dead transitions. [2022-12-12 18:19:16,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 170 transitions, 673 flow [2022-12-12 18:19:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:19:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:19:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-12-12 18:19:16,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2022-12-12 18:19:16,643 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2022-12-12 18:19:16,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 170 transitions, 673 flow [2022-12-12 18:19:16,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 168 transitions, 665 flow [2022-12-12 18:19:16,692 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 168 transitions, 665 flow [2022-12-12 18:19:16,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-12 18:19:16,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:16,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:19:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:19:16,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1823508073, now seen corresponding path program 1 times [2022-12-12 18:19:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:16,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931497091] [2022-12-12 18:19:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:16,750 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-12 18:19:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:16,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931497091] [2022-12-12 18:19:16,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931497091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:19:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732245777] [2022-12-12 18:19:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:19:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:19:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:19:16,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 110 [2022-12-12 18:19:16,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 168 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-12 18:19:16,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:16,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 110 [2022-12-12 18:19:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:18,512 INFO L130 PetriNetUnfolder]: 19719/32201 cut-off events. [2022-12-12 18:19:18,513 INFO L131 PetriNetUnfolder]: For 831/869 co-relation queries the response was YES. [2022-12-12 18:19:18,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93555 conditions, 32201 events. 19719/32201 cut-off events. For 831/869 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 246341 event pairs, 6848 based on Foata normal form. 0/10673 useless extension candidates. Maximal degree in co-relation 92021. Up to 20692 conditions per place. [2022-12-12 18:19:18,600 INFO L137 encePairwiseOnDemand]: 97/110 looper letters, 257 selfloop transitions, 17 changer transitions 0/288 dead transitions. [2022-12-12 18:19:18,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 288 transitions, 1700 flow [2022-12-12 18:19:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:19:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:19:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2022-12-12 18:19:18,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-12 18:19:18,603 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2022-12-12 18:19:18,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 288 transitions, 1700 flow [2022-12-12 18:19:18,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 288 transitions, 1700 flow [2022-12-12 18:19:18,659 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 288 transitions, 1700 flow [2022-12-12 18:19:18,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-12 18:19:18,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:18,659 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:19:18,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:19:18,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1384250486, now seen corresponding path program 1 times [2022-12-12 18:19:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:18,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384000531] [2022-12-12 18:19:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:18,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384000531] [2022-12-12 18:19:18,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384000531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:19:18,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324593922] [2022-12-12 18:19:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:18,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:19:18,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:19:18,782 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-12 18:19:18,817 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-12 18:19:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:18,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-12 18:19:18,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:19:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:18,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:19:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:18,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324593922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 18:19:18,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 18:19:18,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-12 18:19:18,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466576012] [2022-12-12 18:19:18,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 18:19:18,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 18:19:18,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:18,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 18:19:18,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 18:19:18,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 110 [2022-12-12 18:19:18,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 288 transitions, 1700 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-12 18:19:18,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:18,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 110 [2022-12-12 18:19:18,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:23,192 INFO L130 PetriNetUnfolder]: 37431/60972 cut-off events. [2022-12-12 18:19:23,193 INFO L131 PetriNetUnfolder]: For 2371/2387 co-relation queries the response was YES. [2022-12-12 18:19:23,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235113 conditions, 60972 events. 37431/60972 cut-off events. For 2371/2387 co-relation queries the response was YES. Maximal size of possible extension queue 2231. Compared 495008 event pairs, 5910 based on Foata normal form. 0/21178 useless extension candidates. Maximal degree in co-relation 231606. Up to 42162 conditions per place. [2022-12-12 18:19:23,393 INFO L137 encePairwiseOnDemand]: 94/110 looper letters, 676 selfloop transitions, 92 changer transitions 201/981 dead transitions. [2022-12-12 18:19:23,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 981 transitions, 7780 flow [2022-12-12 18:19:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 18:19:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 18:19:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 947 transitions. [2022-12-12 18:19:23,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45311004784688996 [2022-12-12 18:19:23,399 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2022-12-12 18:19:23,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 981 transitions, 7780 flow [2022-12-12 18:19:23,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 780 transitions, 6176 flow [2022-12-12 18:19:23,532 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 780 transitions, 6176 flow [2022-12-12 18:19:23,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-12 18:19:23,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:23,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:19:23,555 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-12 18:19:23,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:19:23,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 152268609, now seen corresponding path program 1 times [2022-12-12 18:19:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228669035] [2022-12-12 18:19:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:23,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:23,864 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-12 18:19:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:23,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228669035] [2022-12-12 18:19:23,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228669035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:23,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:23,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:19:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704914653] [2022-12-12 18:19:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:19:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:19:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:19:23,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 110 [2022-12-12 18:19:23,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 780 transitions, 6176 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-12 18:19:23,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:23,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 110 [2022-12-12 18:19:23,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:25,656 INFO L130 PetriNetUnfolder]: 11311/19797 cut-off events. [2022-12-12 18:19:25,657 INFO L131 PetriNetUnfolder]: For 1923/1923 co-relation queries the response was YES. [2022-12-12 18:19:25,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96351 conditions, 19797 events. 11311/19797 cut-off events. For 1923/1923 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 145142 event pairs, 287 based on Foata normal form. 27/7631 useless extension candidates. Maximal degree in co-relation 92987. Up to 15504 conditions per place. [2022-12-12 18:19:25,711 INFO L137 encePairwiseOnDemand]: 88/110 looper letters, 362 selfloop transitions, 37 changer transitions 230/641 dead transitions. [2022-12-12 18:19:25,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 641 transitions, 6363 flow [2022-12-12 18:19:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:19:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:19:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2022-12-12 18:19:25,712 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2022-12-12 18:19:25,713 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-12-12 18:19:25,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 641 transitions, 6363 flow [2022-12-12 18:19:25,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 411 transitions, 4095 flow [2022-12-12 18:19:25,748 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 411 transitions, 4095 flow [2022-12-12 18:19:25,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-12 18:19:25,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:25,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:19:25,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:19:25,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:25,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1987980105, now seen corresponding path program 1 times [2022-12-12 18:19:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:25,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254561279] [2022-12-12 18:19:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:25,785 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-12 18:19:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254561279] [2022-12-12 18:19:25,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254561279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:25,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:25,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:19:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100514375] [2022-12-12 18:19:25,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:25,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:19:25,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:25,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:19:25,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:19:25,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 110 [2022-12-12 18:19:25,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 411 transitions, 4095 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 18:19:25,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:25,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 110 [2022-12-12 18:19:25,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:26,464 INFO L130 PetriNetUnfolder]: 4169/7688 cut-off events. [2022-12-12 18:19:26,464 INFO L131 PetriNetUnfolder]: For 1138/1138 co-relation queries the response was YES. [2022-12-12 18:19:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43852 conditions, 7688 events. 4169/7688 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 48317 event pairs, 103 based on Foata normal form. 0/4241 useless extension candidates. Maximal degree in co-relation 41881. Up to 5650 conditions per place. [2022-12-12 18:19:26,503 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 415 selfloop transitions, 11 changer transitions 5/441 dead transitions. [2022-12-12 18:19:26,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 441 transitions, 5272 flow [2022-12-12 18:19:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:19:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:19:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-12 18:19:26,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2022-12-12 18:19:26,505 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -38 predicate places. [2022-12-12 18:19:26,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 441 transitions, 5272 flow [2022-12-12 18:19:26,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 436 transitions, 5209 flow [2022-12-12 18:19:26,538 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 436 transitions, 5209 flow [2022-12-12 18:19:26,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-12 18:19:26,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:26,538 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] [2022-12-12 18:19:26,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:19:26,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -179449307, now seen corresponding path program 1 times [2022-12-12 18:19:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:26,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719956544] [2022-12-12 18:19:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:27,515 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-12 18:19:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:27,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719956544] [2022-12-12 18:19:27,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719956544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:27,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:27,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-12 18:19:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169804761] [2022-12-12 18:19:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:27,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 18:19:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 18:19:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-12 18:19:27,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 110 [2022-12-12 18:19:27,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 436 transitions, 5209 flow. Second operand has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 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-12 18:19:27,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:27,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 110 [2022-12-12 18:19:27,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:29,567 INFO L130 PetriNetUnfolder]: 6020/11076 cut-off events. [2022-12-12 18:19:29,567 INFO L131 PetriNetUnfolder]: For 2228/2228 co-relation queries the response was YES. [2022-12-12 18:19:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73631 conditions, 11076 events. 6020/11076 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 76662 event pairs, 41 based on Foata normal form. 0/6086 useless extension candidates. Maximal degree in co-relation 70333. Up to 7984 conditions per place. [2022-12-12 18:19:29,619 INFO L137 encePairwiseOnDemand]: 93/110 looper letters, 678 selfloop transitions, 39 changer transitions 2/727 dead transitions. [2022-12-12 18:19:29,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 727 transitions, 10155 flow [2022-12-12 18:19:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 18:19:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 18:19:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 448 transitions. [2022-12-12 18:19:29,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20363636363636364 [2022-12-12 18:19:29,622 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -19 predicate places. [2022-12-12 18:19:29,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 727 transitions, 10155 flow [2022-12-12 18:19:29,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 725 transitions, 10147 flow [2022-12-12 18:19:29,664 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 725 transitions, 10147 flow [2022-12-12 18:19:29,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 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-12 18:19:29,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:29,665 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] [2022-12-12 18:19:29,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:19:29,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2142090057, now seen corresponding path program 2 times [2022-12-12 18:19:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:29,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306931845] [2022-12-12 18:19:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:30,518 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-12 18:19:30,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:30,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306931845] [2022-12-12 18:19:30,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306931845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:30,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:30,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-12 18:19:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852816094] [2022-12-12 18:19:30,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:30,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 18:19:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 18:19:30,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-12-12 18:19:30,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 110 [2022-12-12 18:19:30,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 725 transitions, 10147 flow. Second operand has 17 states, 17 states have (on average 10.235294117647058) internal successors, (174), 17 states have internal predecessors, (174), 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-12 18:19:30,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:30,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 110 [2022-12-12 18:19:30,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:33,236 INFO L130 PetriNetUnfolder]: 7621/14121 cut-off events. [2022-12-12 18:19:33,236 INFO L131 PetriNetUnfolder]: For 2252/2252 co-relation queries the response was YES. [2022-12-12 18:19:33,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107375 conditions, 14121 events. 7621/14121 cut-off events. For 2252/2252 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 104665 event pairs, 75 based on Foata normal form. 0/7709 useless extension candidates. Maximal degree in co-relation 102504. Up to 9965 conditions per place. [2022-12-12 18:19:33,314 INFO L137 encePairwiseOnDemand]: 93/110 looper letters, 885 selfloop transitions, 49 changer transitions 0/942 dead transitions. [2022-12-12 18:19:33,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 942 transitions, 15075 flow [2022-12-12 18:19:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 18:19:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 18:19:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 393 transitions. [2022-12-12 18:19:33,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22329545454545455 [2022-12-12 18:19:33,317 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -5 predicate places. [2022-12-12 18:19:33,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 942 transitions, 15075 flow [2022-12-12 18:19:33,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 942 transitions, 15075 flow [2022-12-12 18:19:33,611 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 942 transitions, 15075 flow [2022-12-12 18:19:33,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.235294117647058) internal successors, (174), 17 states have internal predecessors, (174), 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-12 18:19:33,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:33,619 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] [2022-12-12 18:19:33,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:19:33,620 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1251610605, now seen corresponding path program 3 times [2022-12-12 18:19:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:33,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058659609] [2022-12-12 18:19:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:34,210 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-12 18:19:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058659609] [2022-12-12 18:19:34,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058659609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:34,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:19:34,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-12 18:19:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71523993] [2022-12-12 18:19:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:34,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 18:19:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 18:19:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-12 18:19:34,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 18:19:34,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 942 transitions, 15075 flow. Second operand has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 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-12 18:19:34,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:34,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 18:19:34,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:37,254 INFO L130 PetriNetUnfolder]: 7147/13391 cut-off events. [2022-12-12 18:19:37,255 INFO L131 PetriNetUnfolder]: For 2871/2871 co-relation queries the response was YES. [2022-12-12 18:19:37,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114392 conditions, 13391 events. 7147/13391 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 96619 event pairs, 93 based on Foata normal form. 0/7486 useless extension candidates. Maximal degree in co-relation 109009. Up to 10433 conditions per place. [2022-12-12 18:19:37,315 INFO L137 encePairwiseOnDemand]: 93/110 looper letters, 754 selfloop transitions, 41 changer transitions 144/951 dead transitions. [2022-12-12 18:19:37,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 951 transitions, 17127 flow [2022-12-12 18:19:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 18:19:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 18:19:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 354 transitions. [2022-12-12 18:19:37,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22987012987012986 [2022-12-12 18:19:37,317 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-12-12 18:19:37,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 951 transitions, 17127 flow [2022-12-12 18:19:37,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 807 transitions, 14454 flow [2022-12-12 18:19:37,367 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 807 transitions, 14454 flow [2022-12-12 18:19:37,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 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-12 18:19:37,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:37,367 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-12 18:19:37,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:19:37,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1230107030, now seen corresponding path program 2 times [2022-12-12 18:19:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:37,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61405365] [2022-12-12 18:19:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:37,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:37,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61405365] [2022-12-12 18:19:37,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61405365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:19:37,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718728052] [2022-12-12 18:19:37,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 18:19:37,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:19:37,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:19:37,500 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-12 18:19:37,525 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-12 18:19:37,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 18:19:37,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 18:19:37,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 18:19:37,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:19:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:37,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:19:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:37,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718728052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 18:19:37,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 18:19:37,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-12-12 18:19:37,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382050995] [2022-12-12 18:19:37,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 18:19:37,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 18:19:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 18:19:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-12 18:19:37,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 110 [2022-12-12 18:19:37,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 807 transitions, 14454 flow. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 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-12 18:19:37,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:37,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 110 [2022-12-12 18:19:37,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:39,575 INFO L130 PetriNetUnfolder]: 6623/11905 cut-off events. [2022-12-12 18:19:39,575 INFO L131 PetriNetUnfolder]: For 2413/2413 co-relation queries the response was YES. [2022-12-12 18:19:39,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114011 conditions, 11905 events. 6623/11905 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 77100 event pairs, 93 based on Foata normal form. 0/6824 useless extension candidates. Maximal degree in co-relation 110044. Up to 9276 conditions per place. [2022-12-12 18:19:39,658 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 943 selfloop transitions, 30 changer transitions 0/985 dead transitions. [2022-12-12 18:19:39,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 985 transitions, 19638 flow [2022-12-12 18:19:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 18:19:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 18:19:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 385 transitions. [2022-12-12 18:19:39,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-12 18:19:39,660 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2022-12-12 18:19:39,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 985 transitions, 19638 flow [2022-12-12 18:19:39,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 985 transitions, 19638 flow [2022-12-12 18:19:39,730 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 985 transitions, 19638 flow [2022-12-12 18:19:39,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 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-12 18:19:39,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:39,730 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:19:39,746 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-12 18:19:39,935 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-12 18:19:39,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1461475334, now seen corresponding path program 1 times [2022-12-12 18:19:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024194816] [2022-12-12 18:19:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:40,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024194816] [2022-12-12 18:19:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024194816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:19:40,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258544798] [2022-12-12 18:19:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:40,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:19:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:19:40,721 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-12 18:19:40,723 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-12 18:19:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:40,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-12 18:19:40,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:19:41,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-12 18:19:41,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-12 18:19:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:47,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:19:47,478 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-12 18:19:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 18:19:47,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258544798] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 18:19:47,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 18:19:47,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 15] total 43 [2022-12-12 18:19:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206194641] [2022-12-12 18:19:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:47,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 18:19:47,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 18:19:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1750, Unknown=1, NotChecked=0, Total=1892 [2022-12-12 18:19:47,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 18:19:47,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 985 transitions, 19638 flow. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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-12 18:19:47,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:47,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 18:19:47,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:19:54,330 INFO L130 PetriNetUnfolder]: 14738/26407 cut-off events. [2022-12-12 18:19:54,331 INFO L131 PetriNetUnfolder]: For 6678/6678 co-relation queries the response was YES. [2022-12-12 18:19:54,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277549 conditions, 26407 events. 14738/26407 cut-off events. For 6678/6678 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 197572 event pairs, 279 based on Foata normal form. 0/14662 useless extension candidates. Maximal degree in co-relation 266693. Up to 22548 conditions per place. [2022-12-12 18:19:54,525 INFO L137 encePairwiseOnDemand]: 94/110 looper letters, 2324 selfloop transitions, 214 changer transitions 0/2550 dead transitions. [2022-12-12 18:19:54,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 2550 transitions, 56298 flow [2022-12-12 18:19:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-12 18:19:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-12 18:19:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 605 transitions. [2022-12-12 18:19:54,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-12 18:19:54,529 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 44 predicate places. [2022-12-12 18:19:54,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 2550 transitions, 56298 flow [2022-12-12 18:19:54,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 2550 transitions, 56298 flow [2022-12-12 18:19:54,692 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 2550 transitions, 56298 flow [2022-12-12 18:19:54,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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-12 18:19:54,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:19:54,692 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:19:54,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 18:19:54,896 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-12 18:19:54,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:19:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:19:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 344278910, now seen corresponding path program 2 times [2022-12-12 18:19:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:19:54,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627843764] [2022-12-12 18:19:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:19:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:19:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:19:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:19:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:19:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627843764] [2022-12-12 18:19:55,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627843764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:19:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756518418] [2022-12-12 18:19:55,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 18:19:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:19:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:19:55,776 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-12 18:19:55,778 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-12 18:19:55,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-12 18:19:55,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 18:19:55,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-12 18:19:55,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:19:55,879 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-12 18:19:55,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-12 18:19:56,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-12 18:19:56,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2022-12-12 18:19:56,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-12 18:19:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 18:19:57,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 18:19:57,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756518418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:19:57,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 18:19:57,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 30 [2022-12-12 18:19:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259784328] [2022-12-12 18:19:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:19:57,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 18:19:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:19:57,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 18:19:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=916, Unknown=0, NotChecked=0, Total=992 [2022-12-12 18:19:57,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 18:19:57,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 2550 transitions, 56298 flow. Second operand has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 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-12 18:19:57,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:19:57,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 18:19:57,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:20:00,844 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-12 18:20:02,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-12 18:20:06,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:08,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:10,693 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-12 18:20:12,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:14,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:17,577 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-12 18:20:19,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:22,418 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-12 18:20:25,051 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-12 18:20:26,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:28,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:30,558 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-12 18:20:32,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 [0] [2022-12-12 18:20:34,611 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-12 18:20:36,640 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-12 18:20:38,663 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-12 18:20:40,697 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-12 18:20:42,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:44,761 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-12 18:20:46,842 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-12 18:20:48,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:50,237 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-12 18:20:52,271 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-12 18:20:54,730 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-12 18:20:57,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:20:59,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:01,660 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-12 18:21:03,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:05,771 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-12 18:21:07,796 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-12 18:21:09,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:11,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:13,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:15,125 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-12 18:21:17,148 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-12 18:21:20,841 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-12 18:21:22,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:24,894 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-12 18:21:27,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:29,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:32,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:34,527 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-12 18:21:36,547 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-12 18:21:38,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:39,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:41,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:44,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:46,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:48,632 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-12 18:21:50,690 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-12 18:21:52,718 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-12 18:21:54,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:21:56,785 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-12 18:21:58,967 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-12 18:22:01,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:03,032 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-12 18:22:05,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:07,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:09,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:11,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:13,395 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-12 18:22:15,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:17,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:19,937 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-12 18:22:22,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:24,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:26,789 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-12 18:22:30,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:32,967 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-12 18:22:35,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:36,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:38,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:40,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:42,724 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-12 18:22:44,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:46,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:48,939 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-12 18:22:50,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:53,009 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-12 18:22:55,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:22:57,063 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-12 18:22:59,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:01,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:03,466 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-12 18:23:05,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:07,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:10,108 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-12 18:23:12,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:14,522 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-12 18:23:16,544 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-12 18:23:18,575 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-12 18:23:20,640 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-12 18:23:23,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:25,089 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-12 18:23:27,115 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-12 18:23:29,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:31,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:33,628 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-12 18:23:36,013 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-12 18:23:38,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:40,067 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-12 18:23:42,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-12 18:23:44,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:46,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:48,351 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-12 18:23:50,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:52,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:23:54,269 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-12 18:23:56,291 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-12 18:23:58,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:00,357 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-12 18:24:02,380 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-12 18:24:04,407 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-12 18:24:06,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:09,080 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-12 18:24:11,166 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-12 18:24:13,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:14,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:16,981 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-12 18:24:19,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:21,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:23,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:25,269 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-12 18:24:27,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 [0] [2022-12-12 18:24:29,319 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-12 18:24:31,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:33,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:35,451 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-12 18:24:37,495 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-12 18:24:40,925 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-12 18:24:43,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:44,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:46,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:48,432 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-12 18:24:51,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:53,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:55,363 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-12 18:24:57,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:24:59,556 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-12 18:25:01,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:25:03,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:25:06,330 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-12 18:25:08,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:25:16,348 INFO L130 PetriNetUnfolder]: 20351/36600 cut-off events. [2022-12-12 18:25:16,349 INFO L131 PetriNetUnfolder]: For 12722/12722 co-relation queries the response was YES. [2022-12-12 18:25:16,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419386 conditions, 36600 events. 20351/36600 cut-off events. For 12722/12722 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 286370 event pairs, 303 based on Foata normal form. 0/20056 useless extension candidates. Maximal degree in co-relation 402149. Up to 32206 conditions per place. [2022-12-12 18:25:16,609 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 3227 selfloop transitions, 310 changer transitions 0/3549 dead transitions. [2022-12-12 18:25:16,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 3549 transitions, 85490 flow [2022-12-12 18:25:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-12 18:25:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-12 18:25:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 596 transitions. [2022-12-12 18:25:16,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2083916083916084 [2022-12-12 18:25:16,613 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 69 predicate places. [2022-12-12 18:25:16,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 3549 transitions, 85490 flow [2022-12-12 18:25:16,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 3549 transitions, 85490 flow [2022-12-12 18:25:16,937 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 3549 transitions, 85490 flow [2022-12-12 18:25:16,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 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-12 18:25:16,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:25:16,937 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:25:16,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-12 18:25:17,141 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-12 18:25:17,142 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:25:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:25:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 835067920, now seen corresponding path program 1 times [2022-12-12 18:25:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:25:17,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131632480] [2022-12-12 18:25:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:25:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:25:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:25:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:25:17,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:25:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131632480] [2022-12-12 18:25:17,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131632480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:25:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535267881] [2022-12-12 18:25:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:25:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:25:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:25:17,881 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-12 18:25:17,883 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-12 18:25:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:25:17,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-12 18:25:17,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:25:17,986 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 18:25:17,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-12 18:25:18,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-12 18:25:18,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-12 18:25:18,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-12 18:25:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:25:20,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:25:20,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_370) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-12 18:25:20,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 18:25:20,902 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-12 18:25:20,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 18:25:20,913 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-12 18:25:20,920 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-12 18:25:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 18:25:21,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535267881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 18:25:21,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 18:25:21,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 46 [2022-12-12 18:25:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991768037] [2022-12-12 18:25:21,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 18:25:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-12 18:25:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:25:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-12 18:25:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1999, Unknown=1, NotChecked=90, Total=2256 [2022-12-12 18:25:21,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 18:25:21,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 3549 transitions, 85490 flow. Second operand has 48 states, 48 states have (on average 11.8125) internal successors, (567), 48 states have internal predecessors, (567), 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-12 18:25:21,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:25:21,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 18:25:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:26:05,192 INFO L130 PetriNetUnfolder]: 33911/61208 cut-off events. [2022-12-12 18:26:05,193 INFO L131 PetriNetUnfolder]: For 25441/25441 co-relation queries the response was YES. [2022-12-12 18:26:05,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758658 conditions, 61208 events. 33911/61208 cut-off events. For 25441/25441 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 519656 event pairs, 223 based on Foata normal form. 0/33712 useless extension candidates. Maximal degree in co-relation 727648. Up to 55500 conditions per place. [2022-12-12 18:26:05,632 INFO L137 encePairwiseOnDemand]: 79/110 looper letters, 5142 selfloop transitions, 1019 changer transitions 0/6173 dead transitions. [2022-12-12 18:26:05,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 6173 transitions, 161011 flow [2022-12-12 18:26:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-12 18:26:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-12-12 18:26:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 1565 transitions. [2022-12-12 18:26:05,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1976010101010101 [2022-12-12 18:26:05,649 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 140 predicate places. [2022-12-12 18:26:05,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 6173 transitions, 161011 flow [2022-12-12 18:26:06,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 6173 transitions, 161011 flow [2022-12-12 18:26:06,042 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 6173 transitions, 161011 flow [2022-12-12 18:26:06,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 11.8125) internal successors, (567), 48 states have internal predecessors, (567), 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-12 18:26:06,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:26:06,043 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:26:06,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-12 18:26:06,247 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-12 18:26:06,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:26:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:26:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash 382555302, now seen corresponding path program 1 times [2022-12-12 18:26:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:26:06,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953267449] [2022-12-12 18:26:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:26:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:26:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:26:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-12 18:26:06,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:26:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953267449] [2022-12-12 18:26:06,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953267449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:26:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89265011] [2022-12-12 18:26:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:26:06,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:26:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:26:06,383 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-12 18:26:06,415 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-12 18:26:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:26:06,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 18:26:06,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:26:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-12 18:26:06,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:26:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-12 18:26:06,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89265011] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 18:26:06,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 18:26:06,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-12 18:26:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580434485] [2022-12-12 18:26:06,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 18:26:06,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 18:26:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:26:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 18:26:06,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-12 18:26:06,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 110 [2022-12-12 18:26:06,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 6173 transitions, 161011 flow. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 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-12 18:26:06,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:26:06,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 110 [2022-12-12 18:26:06,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:27:18,545 INFO L130 PetriNetUnfolder]: 40905/73658 cut-off events. [2022-12-12 18:27:18,545 INFO L131 PetriNetUnfolder]: For 31607/31607 co-relation queries the response was YES. [2022-12-12 18:27:18,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983832 conditions, 73658 events. 40905/73658 cut-off events. For 31607/31607 co-relation queries the response was YES. Maximal size of possible extension queue 1531. Compared 632843 event pairs, 161 based on Foata normal form. 0/40554 useless extension candidates. Maximal degree in co-relation 942102. Up to 67407 conditions per place. [2022-12-12 18:27:19,076 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 7037 selfloop transitions, 206 changer transitions 257/7512 dead transitions. [2022-12-12 18:27:19,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 7512 transitions, 210976 flow [2022-12-12 18:27:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 18:27:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 18:27:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 365 transitions. [2022-12-12 18:27:19,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2765151515151515 [2022-12-12 18:27:19,078 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 151 predicate places. [2022-12-12 18:27:19,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 262 places, 7512 transitions, 210976 flow [2022-12-12 18:27:19,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 7255 transitions, 203648 flow [2022-12-12 18:27:19,739 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 7255 transitions, 203648 flow [2022-12-12 18:27:19,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 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-12 18:27:19,739 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:27:19,739 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:27:19,744 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-12 18:27:19,943 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-12 18:27:19,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:27:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:27:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 299198293, now seen corresponding path program 1 times [2022-12-12 18:27:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:27:19,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442738084] [2022-12-12 18:27:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:27:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:27:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:27:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:27:20,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:27:20,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442738084] [2022-12-12 18:27:20,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442738084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:27:20,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410254704] [2022-12-12 18:27:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:27:20,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:27:20,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:27:20,714 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-12 18:27:20,716 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-12 18:27:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:27:20,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-12 18:27:20,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:27:21,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-12 18:27:21,526 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 72 treesize of output 43 [2022-12-12 18:27:26,577 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-12 18:27:26,577 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 115 treesize of output 49 [2022-12-12 18:27:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:27:34,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:27:36,278 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-12 18:27:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:27:36,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410254704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 18:27:36,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 18:27:36,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 57 [2022-12-12 18:27:36,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743775059] [2022-12-12 18:27:36,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 18:27:36,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-12 18:27:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:27:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-12 18:27:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3104, Unknown=4, NotChecked=0, Total=3422 [2022-12-12 18:27:36,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 18:27:36,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 7255 transitions, 203648 flow. Second operand has 59 states, 59 states have (on average 11.88135593220339) internal successors, (701), 59 states have internal predecessors, (701), 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-12 18:27:36,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:27:36,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 18:27:36,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:27:41,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:27:43,779 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-12 18:27:45,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:27:47,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:27:49,333 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-12 18:27:51,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:27:53,628 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-12 18:27:55,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:27:57,212 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-12 18:27:59,245 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-12 18:28:01,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:03,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:04,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:07,030 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-12 18:28:11,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:13,422 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-12 18:28:27,000 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-12 18:28:29,047 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-12 18:28:32,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:35,546 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-12 18:28:37,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:39,283 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-12 18:28:41,632 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-12 18:28:43,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:47,204 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-12 18:28:50,425 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-12 18:28:52,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:28:56,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:29:00,013 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-12 18:29:02,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:29:06,893 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-12 18:29:10,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-12 18:29:15,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:29:21,988 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-12 18:29:28,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:29:37,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:29:40,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:29:46,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 18:32:05,129 INFO L130 PetriNetUnfolder]: 58829/106645 cut-off events. [2022-12-12 18:32:05,129 INFO L131 PetriNetUnfolder]: For 47830/47830 co-relation queries the response was YES. [2022-12-12 18:32:05,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525060 conditions, 106645 events. 58829/106645 cut-off events. For 47830/47830 co-relation queries the response was YES. Maximal size of possible extension queue 2039. Compared 927777 event pairs, 179 based on Foata normal form. 0/60217 useless extension candidates. Maximal degree in co-relation 1462051. Up to 98718 conditions per place. [2022-12-12 18:32:05,933 INFO L137 encePairwiseOnDemand]: 92/110 looper letters, 9881 selfloop transitions, 639 changer transitions 1037/11569 dead transitions. [2022-12-12 18:32:05,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 11569 transitions, 348004 flow [2022-12-12 18:32:05,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-12 18:32:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-12 18:32:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1360 transitions. [2022-12-12 18:32:05,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19624819624819625 [2022-12-12 18:32:05,956 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 213 predicate places. [2022-12-12 18:32:05,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 11569 transitions, 348004 flow [2022-12-12 18:32:06,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 10532 transitions, 316339 flow [2022-12-12 18:32:06,702 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 10532 transitions, 316339 flow [2022-12-12 18:32:06,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 11.88135593220339) internal successors, (701), 59 states have internal predecessors, (701), 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-12 18:32:06,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:32:06,702 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:32:06,709 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-12 18:32:06,907 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-12 18:32:06,908 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:32:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:32:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1274685071, now seen corresponding path program 2 times [2022-12-12 18:32:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:32:06,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686996231] [2022-12-12 18:32:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:32:06,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:32:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:32:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:32:08,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686996231] [2022-12-12 18:32:08,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686996231] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 18:32:08,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639078720] [2022-12-12 18:32:08,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 18:32:08,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 18:32:08,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:32:08,655 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-12 18:32:08,658 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-12 18:32:08,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 18:32:08,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 18:32:08,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-12 18:32:08,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 18:32:08,790 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-12 18:32:08,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 18:32:08,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-12-12 18:32:09,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-12 18:32:09,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 18:32:09,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-12-12 18:32:10,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-12 18:32:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:12,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 18:32:13,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_553) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-12 18:32:13,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 18:32:13,779 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-12 18:32:13,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 18:32:13,789 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-12 18:32:13,793 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-12 18:32:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:32:14,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639078720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 18:32:14,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 18:32:14,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 59 [2022-12-12 18:32:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539626983] [2022-12-12 18:32:14,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 18:32:14,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-12 18:32:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:32:14,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-12 18:32:14,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3330, Unknown=1, NotChecked=116, Total=3660 [2022-12-12 18:32:14,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 110 [2022-12-12 18:32:14,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 10532 transitions, 316339 flow. Second operand has 61 states, 61 states have (on average 10.819672131147541) internal successors, (660), 61 states have internal predecessors, (660), 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-12 18:32:14,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:32:14,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 110 [2022-12-12 18:32:14,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 18:33:20,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-12 18:33:20,917 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:33:20,924 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-12 18:33:20,937 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-12 18:33:20,938 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-12 18:33:21,123 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-12 18:33:21,123 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. [2022-12-12 18:33:21,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-12 18:33:21,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:33:21,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-12 18:33:21,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-12 18:33:21,132 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:33:21,132 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-12 18:33:21,137 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:33:21,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:33:21,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:33:21 BasicIcfg [2022-12-12 18:33:21,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:33:21,144 INFO L158 Benchmark]: Toolchain (without parser) took 851936.83ms. Allocated memory was 188.7MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 144.4MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 448.1MB. Max. memory is 8.0GB. [2022-12-12 18:33:21,144 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 188.7MB. Free memory was 165.3MB in the beginning and 165.2MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:33:21,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.16ms. Allocated memory is still 188.7MB. Free memory was 143.9MB in the beginning and 115.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 18:33:21,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.03ms. Allocated memory is still 188.7MB. Free memory was 115.1MB in the beginning and 112.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:33:21,147 INFO L158 Benchmark]: Boogie Preprocessor took 30.42ms. Allocated memory is still 188.7MB. Free memory was 112.4MB in the beginning and 110.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:33:21,150 INFO L158 Benchmark]: RCFGBuilder took 402.19ms. Allocated memory is still 188.7MB. Free memory was 110.3MB in the beginning and 93.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-12 18:33:21,150 INFO L158 Benchmark]: TraceAbstraction took 851063.14ms. Allocated memory was 188.7MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 92.0MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 395.7MB. Max. memory is 8.0GB. [2022-12-12 18:33:21,151 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.47ms. Allocated memory is still 188.7MB. Free memory was 165.3MB in the beginning and 165.2MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 390.16ms. Allocated memory is still 188.7MB. Free memory was 143.9MB in the beginning and 115.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.03ms. Allocated memory is still 188.7MB. Free memory was 115.1MB in the beginning and 112.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.42ms. Allocated memory is still 188.7MB. Free memory was 112.4MB in the beginning and 110.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 402.19ms. Allocated memory is still 188.7MB. Free memory was 110.3MB in the beginning and 93.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 851063.14ms. Allocated memory was 188.7MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 92.0MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 395.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 140 PlacesBefore, 111 PlacesAfterwards, 143 TransitionsBefore, 110 TransitionsAfterwards, 6382 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 75 ConcurrentYvCompositions, 6 ChoiceCompositions, 120 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15234, independent: 14979, independent conditional: 14979, independent unconditional: 0, dependent: 255, dependent conditional: 255, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15234, independent: 14979, independent conditional: 0, independent unconditional: 14979, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15234, independent: 14979, independent conditional: 0, independent unconditional: 14979, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15234, independent: 14979, independent conditional: 0, independent unconditional: 14979, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6330, independent: 6260, independent conditional: 0, independent unconditional: 6260, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6330, independent: 6257, independent conditional: 0, independent unconditional: 6257, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15234, independent: 8719, independent conditional: 0, independent unconditional: 8719, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 6330, unknown conditional: 0, unknown unconditional: 6330] , Statistics on independence cache: Total cache size (in pairs): 15322, Positive cache size: 15252, Positive conditional cache size: 0, Positive unconditional cache size: 15252, Negative cache size: 70, Negative conditional cache size: 0, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - 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 PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 238 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 851.0s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 799.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 203 mSolverCounterUnknown, 8514 SdHoareTripleChecker+Valid, 422.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8514 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 415.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 522 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46148 IncrementalHoareTripleChecker+Invalid, 47290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 7 mSDtfsCounter, 46148 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 283 SyntacticMatches, 14 SemanticMatches, 595 ConstructedPredicates, 2 IntricatePredicates, 8 DeprecatedPredicates, 12316 ImplicationChecksByTransitivity, 81.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316339occurred in iteration=14, InterpolantAutomatonStates: 292, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 45617 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 572 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 744 ConstructedInterpolants, 43 QuantifiedInterpolants, 14108 SizeOfPredicates, 153 NumberOfNonLiveVariables, 2177 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 60/284 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