/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-pthread/cs_stateful-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 14:37:11,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 14:37:11,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 14:37:11,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 14:37:11,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 14:37:12,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 14:37:12,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 14:37:12,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 14:37:12,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 14:37:12,009 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 14:37:12,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 14:37:12,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 14:37:12,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 14:37:12,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 14:37:12,012 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 14:37:12,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 14:37:12,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 14:37:12,012 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 14:37:12,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 14:37:12,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 14:37:12,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 14:37:12,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 14:37:12,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 14:37:12,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 14:37:12,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 14:37:12,014 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 14:37:12,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 14:37:12,014 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 14:37:12,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 14:37:12,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 14:37:12,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 14:37:12,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 14:37:12,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:37:12,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 14:37:12,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 14:37:12,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 14:37:12,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 14:37:12,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 14:37:12,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 14:37:12,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 14:37:12,017 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 14:37:12,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 14:37:12,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 14:37:12,017 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 14:37:12,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 14:37:12,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 14:37:12,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 14:37:12,221 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 14:37:12,221 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 14:37:12,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2023-12-21 14:37:13,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 14:37:13,400 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 14:37:13,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2023-12-21 14:37:13,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63326d7f2/0e1ab480598e4028b752d4cd7b7fa3d3/FLAGfd09a9362 [2023-12-21 14:37:13,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63326d7f2/0e1ab480598e4028b752d4cd7b7fa3d3 [2023-12-21 14:37:13,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 14:37:13,431 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 14:37:13,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 14:37:13,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 14:37:13,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 14:37:13,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97e2c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13, skipping insertion in model container [2023-12-21 14:37:13,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,471 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 14:37:13,707 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i[23607,23620] [2023-12-21 14:37:13,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:37:13,804 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 14:37:13,825 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i[23607,23620] [2023-12-21 14:37:13,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:37:13,879 INFO L206 MainTranslator]: Completed translation [2023-12-21 14:37:13,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13 WrapperNode [2023-12-21 14:37:13,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 14:37:13,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 14:37:13,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 14:37:13,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 14:37:13,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,937 INFO L138 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 546 [2023-12-21 14:37:13,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 14:37:13,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 14:37:13,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 14:37:13,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 14:37:13,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,973 INFO L175 MemorySlicer]: Split 114 memory accesses to 16 slices as follows [2, 3, 7, 8, 8, 20, 0, 12, 7, 10, 10, 3, 6, 3, 12, 3]. 18 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 0, 0, 3, 3, 6, 0, 6, 0, 2, 2, 0, 2, 0, 4, 0]. The 35 writes are split as follows [0, 1, 1, 2, 2, 8, 0, 3, 1, 4, 4, 1, 2, 1, 4, 1]. [2023-12-21 14:37:13,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:13,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:14,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:14,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:14,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 14:37:14,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 14:37:14,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 14:37:14,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 14:37:14,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (1/1) ... [2023-12-21 14:37:14,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:37:14,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:14,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 14:37:14,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 14:37:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 14:37:14,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-21 14:37:14,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-21 14:37:14,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 14:37:14,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-21 14:37:14,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2023-12-21 14:37:14,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-21 14:37:14,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-21 14:37:14,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-21 14:37:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-21 14:37:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-21 14:37:14,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-21 14:37:14,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-21 14:37:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-21 14:37:14,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-21 14:37:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-21 14:37:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-21 14:37:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-21 14:37:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-21 14:37:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-21 14:37:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-21 14:37:14,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-21 14:37:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 14:37:14,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 14:37:14,310 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 14:37:14,313 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 14:37:14,704 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2023-12-21 14:37:14,705 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-21 14:37:14,705 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-21 14:37:14,705 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-21 14:37:14,705 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-21 14:37:14,705 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-21 14:37:14,705 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-21 14:37:18,887 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 14:37:18,933 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 14:37:18,934 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 14:37:18,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:37:18 BoogieIcfgContainer [2023-12-21 14:37:18,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 14:37:18,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 14:37:18,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 14:37:18,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 14:37:18,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:37:13" (1/3) ... [2023-12-21 14:37:18,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4469d167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:37:18, skipping insertion in model container [2023-12-21 14:37:18,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:13" (2/3) ... [2023-12-21 14:37:18,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4469d167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:37:18, skipping insertion in model container [2023-12-21 14:37:18,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:37:18" (3/3) ... [2023-12-21 14:37:18,941 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2023-12-21 14:37:18,954 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 14:37:18,955 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 14:37:19,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 14:37:19,006 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@55a6952b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 14:37:19,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 14:37:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 14:37:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-21 14:37:19,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:19,041 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:19,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:19,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1941247954, now seen corresponding path program 1 times [2023-12-21 14:37:19,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541002332] [2023-12-21 14:37:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 14:37:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 14:37:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 14:37:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 14:37:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-21 14:37:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 14:37:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 14:37:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 14:37:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:19,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:19,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541002332] [2023-12-21 14:37:19,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541002332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:19,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:19,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 14:37:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565330355] [2023-12-21 14:37:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:19,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 14:37:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 14:37:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:19,540 INFO L87 Difference]: Start difference. First operand has 164 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:19,659 INFO L93 Difference]: Finished difference Result 330 states and 562 transitions. [2023-12-21 14:37:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 14:37:19,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-12-21 14:37:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:19,674 INFO L225 Difference]: With dead ends: 330 [2023-12-21 14:37:19,675 INFO L226 Difference]: Without dead ends: 165 [2023-12-21 14:37:19,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:19,686 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:19,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 485 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:37:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-21 14:37:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2023-12-21 14:37:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.44) internal successors, (144), 100 states have internal predecessors, (144), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 14:37:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2023-12-21 14:37:19,730 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 71 [2023-12-21 14:37:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:19,731 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2023-12-21 14:37:19,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2023-12-21 14:37:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 14:37:19,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:19,735 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:19,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 14:37:19,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:19,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1410362118, now seen corresponding path program 1 times [2023-12-21 14:37:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584718759] [2023-12-21 14:37:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:37:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:37:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 14:37:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:37:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 14:37:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 14:37:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-21 14:37:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:37:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:37:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:37:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:19,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584718759] [2023-12-21 14:37:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584718759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:19,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:19,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 14:37:19,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426731521] [2023-12-21 14:37:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:19,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 14:37:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 14:37:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:19,973 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:20,036 INFO L93 Difference]: Finished difference Result 325 states and 504 transitions. [2023-12-21 14:37:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 14:37:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2023-12-21 14:37:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:20,041 INFO L225 Difference]: With dead ends: 325 [2023-12-21 14:37:20,041 INFO L226 Difference]: Without dead ends: 164 [2023-12-21 14:37:20,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:20,043 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:20,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:37:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-21 14:37:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-12-21 14:37:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 101 states have internal predecessors, (145), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 14:37:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2023-12-21 14:37:20,066 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 74 [2023-12-21 14:37:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:20,067 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2023-12-21 14:37:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2023-12-21 14:37:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 14:37:20,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:20,071 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:20,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 14:37:20,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:20,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 283034204, now seen corresponding path program 1 times [2023-12-21 14:37:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71634048] [2023-12-21 14:37:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:37:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 14:37:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 14:37:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 14:37:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 14:37:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-21 14:37:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-21 14:37:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 14:37:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 14:37:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71634048] [2023-12-21 14:37:20,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71634048] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830513286] [2023-12-21 14:37:20,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:20,247 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) [2023-12-21 14:37:20,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 14:37:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:20,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 14:37:20,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:20,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:37:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830513286] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:37:20,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:37:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-21 14:37:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50848202] [2023-12-21 14:37:20,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:37:20,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 14:37:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 14:37:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-21 14:37:20,718 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 14:37:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:20,783 INFO L93 Difference]: Finished difference Result 328 states and 508 transitions. [2023-12-21 14:37:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 14:37:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 75 [2023-12-21 14:37:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:20,788 INFO L225 Difference]: With dead ends: 328 [2023-12-21 14:37:20,788 INFO L226 Difference]: Without dead ends: 166 [2023-12-21 14:37:20,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-21 14:37:20,791 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:20,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 728 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:37:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-21 14:37:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-12-21 14:37:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 14:37:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2023-12-21 14:37:20,806 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 75 [2023-12-21 14:37:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:20,807 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2023-12-21 14:37:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 14:37:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2023-12-21 14:37:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 14:37:20,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:20,808 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:20,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 14:37:21,015 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 [2023-12-21 14:37:21,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:21,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 799972892, now seen corresponding path program 2 times [2023-12-21 14:37:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:21,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798053274] [2023-12-21 14:37:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 14:37:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 14:37:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 14:37:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-21 14:37:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 14:37:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 14:37:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 14:37:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 14:37:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-12-21 14:37:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798053274] [2023-12-21 14:37:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798053274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419882488] [2023-12-21 14:37:21,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 14:37:21,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:21,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:21,235 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) [2023-12-21 14:37:21,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 14:37:21,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 14:37:21,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 14:37:21,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 14:37:21,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:21,585 INFO L378 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 25 treesize of output 13 [2023-12-21 14:37:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-12-21 14:37:21,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 14:37:21,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419882488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:21,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 14:37:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2023-12-21 14:37:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122036749] [2023-12-21 14:37:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:21,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 14:37:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 14:37:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:37:21,672 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:24,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:26,439 INFO L93 Difference]: Finished difference Result 615 states and 974 transitions. [2023-12-21 14:37:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 14:37:26,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2023-12-21 14:37:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:26,443 INFO L225 Difference]: With dead ends: 615 [2023-12-21 14:37:26,443 INFO L226 Difference]: Without dead ends: 419 [2023-12-21 14:37:26,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 14:37:26,445 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 433 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:26,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1532 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-21 14:37:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-21 14:37:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-21 14:37:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 255 states have (on average 1.4705882352941178) internal successors, (375), 255 states have internal predecessors, (375), 139 states have call successors, (139), 24 states have call predecessors, (139), 24 states have return successors, (157), 139 states have call predecessors, (157), 139 states have call successors, (157) [2023-12-21 14:37:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 671 transitions. [2023-12-21 14:37:26,471 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 671 transitions. Word has length 77 [2023-12-21 14:37:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:26,471 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 671 transitions. [2023-12-21 14:37:26,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 671 transitions. [2023-12-21 14:37:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 14:37:26,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:26,474 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:26,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 14:37:26,680 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,SelfDestructingSolverStorable3 [2023-12-21 14:37:26,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:26,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2128466925, now seen corresponding path program 1 times [2023-12-21 14:37:26,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:26,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473421642] [2023-12-21 14:37:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:37:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:37:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:37:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 14:37:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:37:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-21 14:37:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 14:37:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:37:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-21 14:37:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:37:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:37:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-21 14:37:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 14:37:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2023-12-21 14:37:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473421642] [2023-12-21 14:37:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473421642] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140068616] [2023-12-21 14:37:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:27,019 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) [2023-12-21 14:37:27,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 14:37:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 14:37:27,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2023-12-21 14:37:27,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:37:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2023-12-21 14:37:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140068616] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:37:27,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:37:27,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2023-12-21 14:37:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600353799] [2023-12-21 14:37:27,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:37:27,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 14:37:27,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 14:37:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-21 14:37:27,448 INFO L87 Difference]: Start difference. First operand 419 states and 671 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-21 14:37:31,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:35,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:39,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:40,014 INFO L93 Difference]: Finished difference Result 850 states and 1369 transitions. [2023-12-21 14:37:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 14:37:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 138 [2023-12-21 14:37:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:40,017 INFO L225 Difference]: With dead ends: 850 [2023-12-21 14:37:40,018 INFO L226 Difference]: Without dead ends: 439 [2023-12-21 14:37:40,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-21 14:37:40,020 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 35 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:40,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 868 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 609 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2023-12-21 14:37:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-21 14:37:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 429. [2023-12-21 14:37:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 263 states have (on average 1.4600760456273765) internal successors, (384), 265 states have internal predecessors, (384), 139 states have call successors, (139), 24 states have call predecessors, (139), 26 states have return successors, (163), 139 states have call predecessors, (163), 139 states have call successors, (163) [2023-12-21 14:37:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 686 transitions. [2023-12-21 14:37:40,073 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 686 transitions. Word has length 138 [2023-12-21 14:37:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:40,073 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 686 transitions. [2023-12-21 14:37:40,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-21 14:37:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 686 transitions. [2023-12-21 14:37:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-21 14:37:40,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:40,076 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:40,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 14:37:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:40,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:40,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1776494291, now seen corresponding path program 1 times [2023-12-21 14:37:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:40,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464785689] [2023-12-21 14:37:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:37:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:37:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:37:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:37:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-21 14:37:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 14:37:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:37:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-21 14:37:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:37:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:37:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-21 14:37:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 14:37:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 14:37:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 14:37:40,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464785689] [2023-12-21 14:37:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464785689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:40,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:40,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 14:37:40,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544827570] [2023-12-21 14:37:40,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:40,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 14:37:40,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 14:37:40,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:37:40,912 INFO L87 Difference]: Start difference. First operand 429 states and 686 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-21 14:37:45,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:50,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:53,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:55,412 INFO L93 Difference]: Finished difference Result 886 states and 1421 transitions. [2023-12-21 14:37:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 14:37:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2023-12-21 14:37:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:55,416 INFO L225 Difference]: With dead ends: 886 [2023-12-21 14:37:55,416 INFO L226 Difference]: Without dead ends: 608 [2023-12-21 14:37:55,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-12-21 14:37:55,418 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 322 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 159 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:55,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 760 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 845 Invalid, 2 Unknown, 0 Unchecked, 14.1s Time] [2023-12-21 14:37:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2023-12-21 14:37:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 590. [2023-12-21 14:37:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 358 states have (on average 1.452513966480447) internal successors, (520), 365 states have internal predecessors, (520), 192 states have call successors, (192), 32 states have call predecessors, (192), 39 states have return successors, (232), 192 states have call predecessors, (232), 192 states have call successors, (232) [2023-12-21 14:37:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 944 transitions. [2023-12-21 14:37:55,469 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 944 transitions. Word has length 144 [2023-12-21 14:37:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:55,470 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 944 transitions. [2023-12-21 14:37:55,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-21 14:37:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 944 transitions. [2023-12-21 14:37:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-21 14:37:55,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:55,473 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:55,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 14:37:55,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:55,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1863590095, now seen corresponding path program 2 times [2023-12-21 14:37:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:55,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634520364] [2023-12-21 14:37:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:37:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:37:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:37:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:37:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-21 14:37:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 14:37:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:37:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-21 14:37:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:37:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:37:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-21 14:37:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 14:37:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 14:37:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 14:37:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634520364] [2023-12-21 14:37:56,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634520364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:56,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:56,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 14:37:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712592427] [2023-12-21 14:37:56,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:56,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 14:37:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 14:37:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:37:56,055 INFO L87 Difference]: Start difference. First operand 590 states and 944 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 14:38:00,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:01,507 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 [] [2023-12-21 14:38:05,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:06,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:38:07,771 INFO L93 Difference]: Finished difference Result 993 states and 1577 transitions. [2023-12-21 14:38:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 14:38:07,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2023-12-21 14:38:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:38:07,775 INFO L225 Difference]: With dead ends: 993 [2023-12-21 14:38:07,775 INFO L226 Difference]: Without dead ends: 585 [2023-12-21 14:38:07,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-21 14:38:07,777 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 280 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 107 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-12-21 14:38:07,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 852 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 650 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2023-12-21 14:38:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-21 14:38:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 567. [2023-12-21 14:38:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 342 states have (on average 1.3859649122807018) internal successors, (474), 349 states have internal predecessors, (474), 187 states have call successors, (187), 32 states have call predecessors, (187), 37 states have return successors, (222), 185 states have call predecessors, (222), 187 states have call successors, (222) [2023-12-21 14:38:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 883 transitions. [2023-12-21 14:38:07,808 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 883 transitions. Word has length 144 [2023-12-21 14:38:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:38:07,808 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 883 transitions. [2023-12-21 14:38:07,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 14:38:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 883 transitions. [2023-12-21 14:38:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-21 14:38:07,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:38:07,811 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:38:07,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 14:38:07,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:38:07,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:38:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 964601399, now seen corresponding path program 1 times [2023-12-21 14:38:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:38:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210436380] [2023-12-21 14:38:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:38:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:38:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:38:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:38:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:38:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:38:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:38:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:38:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:38:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-21 14:38:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 14:38:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:38:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-21 14:38:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:38:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:38:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-21 14:38:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 14:38:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 14:38:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 14:38:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:38:08,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210436380] [2023-12-21 14:38:08,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210436380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:38:08,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:38:08,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 14:38:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095793032] [2023-12-21 14:38:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:38:08,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 14:38:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:38:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 14:38:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:38:08,926 INFO L87 Difference]: Start difference. First operand 567 states and 883 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-21 14:38:12,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:16,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:20,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:22,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:38:24,059 INFO L93 Difference]: Finished difference Result 814 states and 1267 transitions. [2023-12-21 14:38:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 14:38:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2023-12-21 14:38:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:38:24,062 INFO L225 Difference]: With dead ends: 814 [2023-12-21 14:38:24,062 INFO L226 Difference]: Without dead ends: 540 [2023-12-21 14:38:24,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-21 14:38:24,064 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 318 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 144 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2023-12-21 14:38:24,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 828 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 867 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2023-12-21 14:38:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-12-21 14:38:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 520. [2023-12-21 14:38:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 317 states have (on average 1.4037854889589905) internal successors, (445), 322 states have internal predecessors, (445), 167 states have call successors, (167), 30 states have call predecessors, (167), 35 states have return successors, (197), 167 states have call predecessors, (197), 167 states have call successors, (197) [2023-12-21 14:38:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 809 transitions. [2023-12-21 14:38:24,097 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 809 transitions. Word has length 144 [2023-12-21 14:38:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:38:24,097 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 809 transitions. [2023-12-21 14:38:24,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-21 14:38:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 809 transitions. [2023-12-21 14:38:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-21 14:38:24,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:38:24,101 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:38:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 14:38:24,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:38:24,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:38:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1204776282, now seen corresponding path program 1 times [2023-12-21 14:38:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:38:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871989067] [2023-12-21 14:38:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:38:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:38:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:38:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:38:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:38:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:38:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:38:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:38:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:38:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:38:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:38:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 14:38:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:38:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 14:38:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 14:38:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-21 14:38:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-21 14:38:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-21 14:38:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-12-21 14:38:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-21 14:38:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-21 14:38:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-21 14:38:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-21 14:38:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:38:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-21 14:38:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2023-12-21 14:38:24,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:38:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871989067] [2023-12-21 14:38:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871989067] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:38:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477554653] [2023-12-21 14:38:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:38:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:38:24,857 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) [2023-12-21 14:38:24,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 14:38:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:25,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 14:38:25,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:38:25,374 INFO L378 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 11 treesize of output 7 [2023-12-21 14:38:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 320 proven. 53 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2023-12-21 14:38:25,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:38:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2023-12-21 14:38:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477554653] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:38:26,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:38:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-12-21 14:38:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404304554] [2023-12-21 14:38:26,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:38:26,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 14:38:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:38:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 14:38:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2023-12-21 14:38:26,302 INFO L87 Difference]: Start difference. First operand 520 states and 809 transitions. Second operand has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 28 states have internal predecessors, (113), 15 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 10 states have call predecessors, (60), 15 states have call successors, (60) [2023-12-21 14:38:27,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:31,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:33,583 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 [] [2023-12-21 14:38:39,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:43,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:47,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:38:55,524 INFO L93 Difference]: Finished difference Result 1516 states and 2373 transitions. [2023-12-21 14:38:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-21 14:38:55,525 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 28 states have internal predecessors, (113), 15 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 10 states have call predecessors, (60), 15 states have call successors, (60) Word has length 197 [2023-12-21 14:38:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:38:55,529 INFO L225 Difference]: With dead ends: 1516 [2023-12-21 14:38:55,529 INFO L226 Difference]: Without dead ends: 964 [2023-12-21 14:38:55,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1608, Invalid=6402, Unknown=0, NotChecked=0, Total=8010 [2023-12-21 14:38:55,533 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 1773 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 1293 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1293 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2023-12-21 14:38:55,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 2460 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1293 Valid, 3247 Invalid, 4 Unknown, 0 Unchecked, 25.1s Time] [2023-12-21 14:38:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-21 14:38:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 838. [2023-12-21 14:38:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 512 states have (on average 1.42578125) internal successors, (730), 526 states have internal predecessors, (730), 258 states have call successors, (258), 56 states have call predecessors, (258), 67 states have return successors, (320), 255 states have call predecessors, (320), 258 states have call successors, (320) [2023-12-21 14:38:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1308 transitions. [2023-12-21 14:38:55,616 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1308 transitions. Word has length 197 [2023-12-21 14:38:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:38:55,616 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1308 transitions. [2023-12-21 14:38:55,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.7666666666666666) internal successors, (113), 28 states have internal predecessors, (113), 15 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 10 states have call predecessors, (60), 15 states have call successors, (60) [2023-12-21 14:38:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1308 transitions. [2023-12-21 14:38:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-21 14:38:55,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:38:55,620 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:38:55,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 14:38:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:38:55,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:38:55,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:38:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -911884828, now seen corresponding path program 1 times [2023-12-21 14:38:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:38:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145247177] [2023-12-21 14:38:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:38:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:38:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:38:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:38:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:38:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:38:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:38:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:38:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:38:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:38:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:38:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 14:38:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:38:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 14:38:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 14:38:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-21 14:38:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-21 14:38:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-21 14:38:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-12-21 14:38:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-21 14:38:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-21 14:38:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-21 14:38:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-21 14:38:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:38:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-21 14:38:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2023-12-21 14:38:57,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:38:57,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145247177] [2023-12-21 14:38:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145247177] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:38:57,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757034801] [2023-12-21 14:38:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:57,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:38:57,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:38:57,892 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) [2023-12-21 14:38:57,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 14:38:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:58,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 14:38:58,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:38:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 14:39:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:39:00,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:39:00,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2023-12-21 14:39:05,040 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2023-12-21 14:39:05,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2023-12-21 14:39:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 456 proven. 4 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2023-12-21 14:39:37,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:39:38,109 INFO L378 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 25 treesize of output 23 [2023-12-21 14:39:38,113 INFO L378 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 35 treesize of output 31 [2023-12-21 14:39:38,406 INFO L378 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 20 treesize of output 18 [2023-12-21 14:39:38,409 INFO L378 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 26 treesize of output 22 [2023-12-21 14:39:38,454 INFO L378 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 20 treesize of output 18 [2023-12-21 14:39:38,457 INFO L378 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 26 treesize of output 22 [2023-12-21 14:39:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2023-12-21 14:39:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757034801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:39:38,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:39:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 9] total 40 [2023-12-21 14:39:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312590841] [2023-12-21 14:39:38,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:39:38,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-21 14:39:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:39:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-21 14:39:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1405, Unknown=5, NotChecked=0, Total=1560 [2023-12-21 14:39:38,579 INFO L87 Difference]: Start difference. First operand 838 states and 1308 transitions. Second operand has 40 states, 37 states have (on average 4.027027027027027) internal successors, (149), 36 states have internal predecessors, (149), 19 states have call successors, (66), 13 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 19 states have call successors, (66) [2023-12-21 14:39:41,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:43,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:47,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:48,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:52,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:57,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:59,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:40:03,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:40:06,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:40:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:40:13,394 INFO L93 Difference]: Finished difference Result 1657 states and 2658 transitions. [2023-12-21 14:40:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-21 14:40:13,394 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.027027027027027) internal successors, (149), 36 states have internal predecessors, (149), 19 states have call successors, (66), 13 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 19 states have call successors, (66) Word has length 197 [2023-12-21 14:40:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:40:13,398 INFO L225 Difference]: With dead ends: 1657 [2023-12-21 14:40:13,398 INFO L226 Difference]: Without dead ends: 964 [2023-12-21 14:40:13,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 430 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=935, Invalid=4912, Unknown=5, NotChecked=0, Total=5852 [2023-12-21 14:40:13,402 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 1712 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 1652 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 6102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1652 IncrementalHoareTripleChecker+Valid, 4446 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2023-12-21 14:40:13,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 2713 Invalid, 6102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1652 Valid, 4446 Invalid, 4 Unknown, 0 Unchecked, 32.1s Time] [2023-12-21 14:40:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-21 14:40:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 880. [2023-12-21 14:40:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 537 states have (on average 1.4264432029795158) internal successors, (766), 552 states have internal predecessors, (766), 272 states have call successors, (272), 56 states have call predecessors, (272), 70 states have return successors, (359), 271 states have call predecessors, (359), 272 states have call successors, (359) [2023-12-21 14:40:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1397 transitions. [2023-12-21 14:40:13,503 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1397 transitions. Word has length 197 [2023-12-21 14:40:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:40:13,503 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1397 transitions. [2023-12-21 14:40:13,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.027027027027027) internal successors, (149), 36 states have internal predecessors, (149), 19 states have call successors, (66), 13 states have call predecessors, (66), 14 states have return successors, (66), 17 states have call predecessors, (66), 19 states have call successors, (66) [2023-12-21 14:40:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1397 transitions. [2023-12-21 14:40:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-21 14:40:13,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:40:13,508 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:40:13,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 14:40:13,717 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,SelfDestructingSolverStorable9 [2023-12-21 14:40:13,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:40:13,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:40:13,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1627084640, now seen corresponding path program 1 times [2023-12-21 14:40:13,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:40:13,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618000707] [2023-12-21 14:40:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:40:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:40:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:40:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:40:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:40:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:40:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:40:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:40:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:40:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:40:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:40:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:40:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 14:40:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:40:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 14:40:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 14:40:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-21 14:40:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:40:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:40:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-21 14:40:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-12-21 14:40:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-21 14:40:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-21 14:40:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-21 14:40:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-12-21 14:40:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-12-21 14:40:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-12-21 14:40:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-21 14:40:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-21 14:40:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2023-12-21 14:40:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:40:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618000707] [2023-12-21 14:40:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618000707] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:40:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433361547] [2023-12-21 14:40:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:40:17,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:40:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:40:17,052 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) [2023-12-21 14:40:17,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 14:40:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:40:17,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 14:40:17,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:40:17,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-21 14:40:20,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:40:20,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:40:20,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2023-12-21 14:40:20,321 INFO L349 Elim1Store]: treesize reduction 48, result has 63.1 percent of original size [2023-12-21 14:40:20,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 106 [2023-12-21 14:40:20,578 INFO L378 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 5 treesize of output 3 [2023-12-21 14:40:20,610 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 14:40:20,611 INFO L378 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 25 treesize of output 21 [2023-12-21 14:40:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 480 proven. 51 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-12-21 14:40:20,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:40:20,643 INFO L378 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 12 treesize of output 8 [2023-12-21 14:40:20,751 INFO L378 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 56 treesize of output 54 [2023-12-21 14:40:21,074 INFO L378 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 26 [2023-12-21 14:40:21,158 INFO L378 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 26 [2023-12-21 14:40:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2023-12-21 14:40:21,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433361547] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:40:21,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:40:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 13] total 43 [2023-12-21 14:40:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428223806] [2023-12-21 14:40:21,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:40:21,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 14:40:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:40:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 14:40:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1644, Unknown=2, NotChecked=0, Total=1806 [2023-12-21 14:40:21,383 INFO L87 Difference]: Start difference. First operand 880 states and 1397 transitions. Second operand has 43 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 36 states have internal predecessors, (155), 19 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (68), 18 states have call predecessors, (68), 19 states have call successors, (68) [2023-12-21 14:40:25,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:28,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:32,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:37,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:41,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:45,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:48,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:53,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:57,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:01,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:05,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:09,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:11,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:12,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:14,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:19,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 14:41:23,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:26,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:28,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:31,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:37,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:50,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:41:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:41:51,305 INFO L93 Difference]: Finished difference Result 2116 states and 3314 transitions. [2023-12-21 14:41:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-21 14:41:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 36 states have internal predecessors, (155), 19 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (68), 18 states have call predecessors, (68), 19 states have call successors, (68) Word has length 218 [2023-12-21 14:41:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:41:51,311 INFO L225 Difference]: With dead ends: 2116 [2023-12-21 14:41:51,311 INFO L226 Difference]: Without dead ends: 1270 [2023-12-21 14:41:51,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 483 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1346, Invalid=7964, Unknown=2, NotChecked=0, Total=9312 [2023-12-21 14:41:51,315 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 2188 mSDsluCounter, 7165 mSDsCounter, 0 mSdLazyCounter, 12037 mSolverCounterSat, 1765 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 7623 SdHoareTripleChecker+Invalid, 13821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1765 IncrementalHoareTripleChecker+Valid, 12037 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:41:51,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 7623 Invalid, 13821 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1765 Valid, 12037 Invalid, 19 Unknown, 0 Unchecked, 85.0s Time] [2023-12-21 14:41:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2023-12-21 14:41:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1168. [2023-12-21 14:41:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 719 states have (on average 1.3324061196105703) internal successors, (958), 735 states have internal predecessors, (958), 343 states have call successors, (343), 82 states have call predecessors, (343), 105 states have return successors, (425), 350 states have call predecessors, (425), 343 states have call successors, (425) [2023-12-21 14:41:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1726 transitions. [2023-12-21 14:41:51,482 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1726 transitions. Word has length 218 [2023-12-21 14:41:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:41:51,484 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1726 transitions. [2023-12-21 14:41:51,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 3.7804878048780486) internal successors, (155), 36 states have internal predecessors, (155), 19 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (68), 18 states have call predecessors, (68), 19 states have call successors, (68) [2023-12-21 14:41:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1726 transitions. [2023-12-21 14:41:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-21 14:41:51,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:41:51,490 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:41:51,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 14:41:51,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:41:51,701 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:41:51,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:41:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1514444877, now seen corresponding path program 1 times [2023-12-21 14:41:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:41:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967748844] [2023-12-21 14:41:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:41:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:41:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:41:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:41:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:41:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:41:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:41:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:41:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:41:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:41:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:41:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:41:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:41:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:41:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-21 14:41:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:41:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:41:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:41:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:41:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:41:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:41:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:41:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-21 14:41:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-21 14:41:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-21 14:41:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 14:41:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-21 14:41:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-21 14:41:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-21 14:41:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 14:41:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 14:41:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2023-12-21 14:41:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:41:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967748844] [2023-12-21 14:41:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967748844] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:41:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485785370] [2023-12-21 14:41:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:41:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:41:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:41:53,285 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) [2023-12-21 14:41:53,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 14:41:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:53,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 14:41:53,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:41:54,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-21 14:41:54,132 INFO L378 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 5 treesize of output 3 [2023-12-21 14:41:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 556 proven. 12 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2023-12-21 14:41:54,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:41:54,231 INFO L378 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 12 treesize of output 8 [2023-12-21 14:41:54,321 INFO L378 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 26 [2023-12-21 14:41:54,414 INFO L378 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 26 [2023-12-21 14:41:54,483 INFO L378 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 26 [2023-12-21 14:41:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2023-12-21 14:41:54,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485785370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:41:54,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:41:54,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 32 [2023-12-21 14:41:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63809358] [2023-12-21 14:41:54,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:41:54,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 14:41:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:41:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 14:41:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2023-12-21 14:41:54,623 INFO L87 Difference]: Start difference. First operand 1168 states and 1726 transitions. Second operand has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 26 states have internal predecessors, (155), 16 states have call successors, (79), 11 states have call predecessors, (79), 10 states have return successors, (71), 13 states have call predecessors, (71), 16 states have call successors, (71) [2023-12-21 14:41:58,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:00,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:04,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:06,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:10,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:11,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:13,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:42:22,851 INFO L93 Difference]: Finished difference Result 2270 states and 3366 transitions. [2023-12-21 14:42:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-12-21 14:42:22,852 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 26 states have internal predecessors, (155), 16 states have call successors, (79), 11 states have call predecessors, (79), 10 states have return successors, (71), 13 states have call predecessors, (71), 16 states have call successors, (71) Word has length 245 [2023-12-21 14:42:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:42:22,858 INFO L225 Difference]: With dead ends: 2270 [2023-12-21 14:42:22,858 INFO L226 Difference]: Without dead ends: 1149 [2023-12-21 14:42:22,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 569 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1277, Invalid=5695, Unknown=0, NotChecked=0, Total=6972 [2023-12-21 14:42:22,863 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 2383 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 1846 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 6313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1846 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:42:22,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 3179 Invalid, 6313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1846 Valid, 4464 Invalid, 3 Unknown, 0 Unchecked, 24.0s Time] [2023-12-21 14:42:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-21 14:42:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1090. [2023-12-21 14:42:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 668 states have (on average 1.2979041916167664) internal successors, (867), 687 states have internal predecessors, (867), 317 states have call successors, (317), 80 states have call predecessors, (317), 104 states have return successors, (383), 322 states have call predecessors, (383), 317 states have call successors, (383) [2023-12-21 14:42:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1567 transitions. [2023-12-21 14:42:23,015 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1567 transitions. Word has length 245 [2023-12-21 14:42:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:42:23,016 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1567 transitions. [2023-12-21 14:42:23,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 26 states have internal predecessors, (155), 16 states have call successors, (79), 11 states have call predecessors, (79), 10 states have return successors, (71), 13 states have call predecessors, (71), 16 states have call successors, (71) [2023-12-21 14:42:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1567 transitions. [2023-12-21 14:42:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-21 14:42:23,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:42:23,020 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:42:23,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 14:42:23,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:42:23,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:42:23,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:42:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1411923163, now seen corresponding path program 1 times [2023-12-21 14:42:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:42:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472533095] [2023-12-21 14:42:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:42:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:42:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:42:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:42:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:42:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:42:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:42:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:42:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:42:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:42:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:42:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-21 14:42:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:42:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:42:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:42:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:42:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:42:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:42:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:42:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-21 14:42:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-21 14:42:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-21 14:42:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 14:42:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-21 14:42:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-21 14:42:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-21 14:42:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 14:42:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 14:42:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2023-12-21 14:42:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:42:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472533095] [2023-12-21 14:42:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472533095] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:42:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688894770] [2023-12-21 14:42:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:42:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:42:24,738 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) [2023-12-21 14:42:24,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 14:42:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:25,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-21 14:42:25,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:42:25,618 INFO L378 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 19 treesize of output 18 [2023-12-21 14:42:25,629 INFO L378 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 11 treesize of output 7 [2023-12-21 14:42:25,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-21 14:42:25,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:42:25,641 INFO L378 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 29 treesize of output 22 [2023-12-21 14:42:25,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:42:25,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 14:42:25,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-21 14:42:26,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 14:42:26,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:42:26,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-21 14:42:26,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:42:26,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 10 [2023-12-21 14:42:26,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-21 14:42:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 556 proven. 12 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2023-12-21 14:42:26,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:42:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688894770] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:42:26,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 14:42:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-12-21 14:42:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597496327] [2023-12-21 14:42:26,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 14:42:26,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 14:42:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:42:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 14:42:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 14:42:26,927 INFO L87 Difference]: Start difference. First operand 1090 states and 1567 transitions. Second operand has 28 states, 27 states have (on average 5.444444444444445) internal successors, (147), 23 states have internal predecessors, (147), 15 states have call successors, (62), 12 states have call predecessors, (62), 10 states have return successors, (62), 13 states have call predecessors, (62), 15 states have call successors, (62) [2023-12-21 14:42:30,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:31,279 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 [] [2023-12-21 14:42:34,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:42:41,952 INFO L93 Difference]: Finished difference Result 1700 states and 2461 transitions. [2023-12-21 14:42:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-21 14:42:41,952 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.444444444444445) internal successors, (147), 23 states have internal predecessors, (147), 15 states have call successors, (62), 12 states have call predecessors, (62), 10 states have return successors, (62), 13 states have call predecessors, (62), 15 states have call successors, (62) Word has length 245 [2023-12-21 14:42:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:42:41,956 INFO L225 Difference]: With dead ends: 1700 [2023-12-21 14:42:41,956 INFO L226 Difference]: Without dead ends: 1020 [2023-12-21 14:42:41,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=742, Invalid=3680, Unknown=0, NotChecked=0, Total=4422 [2023-12-21 14:42:41,959 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1399 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 3434 mSolverCounterSat, 1519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2456 SdHoareTripleChecker+Invalid, 4953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1519 IncrementalHoareTripleChecker+Valid, 3434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-21 14:42:41,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2456 Invalid, 4953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1519 Valid, 3434 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2023-12-21 14:42:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2023-12-21 14:42:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 867. [2023-12-21 14:42:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 535 states have (on average 1.2654205607476636) internal successors, (677), 552 states have internal predecessors, (677), 240 states have call successors, (240), 69 states have call predecessors, (240), 91 states have return successors, (291), 245 states have call predecessors, (291), 240 states have call successors, (291) [2023-12-21 14:42:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1208 transitions. [2023-12-21 14:42:42,075 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1208 transitions. Word has length 245 [2023-12-21 14:42:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:42:42,076 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1208 transitions. [2023-12-21 14:42:42,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.444444444444445) internal successors, (147), 23 states have internal predecessors, (147), 15 states have call successors, (62), 12 states have call predecessors, (62), 10 states have return successors, (62), 13 states have call predecessors, (62), 15 states have call successors, (62) [2023-12-21 14:42:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1208 transitions. [2023-12-21 14:42:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-21 14:42:42,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:42:42,079 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:42:42,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-21 14:42:42,280 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,SelfDestructingSolverStorable12 [2023-12-21 14:42:42,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:42:42,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:42:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 577442656, now seen corresponding path program 1 times [2023-12-21 14:42:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:42:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991036797] [2023-12-21 14:42:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:42:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:42:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:42:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:42:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:42:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:42:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:42:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:42:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:42:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:42:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:42:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:42:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:42:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:42:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:42:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:42:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-21 14:42:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-21 14:42:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-21 14:42:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-21 14:42:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-21 14:42:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-12-21 14:42:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 14:42:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 14:42:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-12-21 14:42:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-12-21 14:42:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2023-12-21 14:42:43,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:42:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991036797] [2023-12-21 14:42:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991036797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:42:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302728854] [2023-12-21 14:42:43,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:43,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:42:43,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:42:43,433 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:42:43,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 14:42:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:44,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 14:42:44,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:42:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 478 proven. 2 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2023-12-21 14:42:44,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:42:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2023-12-21 14:42:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302728854] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:42:44,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:42:44,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 7] total 27 [2023-12-21 14:42:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807905942] [2023-12-21 14:42:44,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:42:44,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-21 14:42:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:42:44,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-21 14:42:44,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2023-12-21 14:42:44,793 INFO L87 Difference]: Start difference. First operand 867 states and 1208 transitions. Second operand has 27 states, 24 states have (on average 6.25) internal successors, (150), 21 states have internal predecessors, (150), 15 states have call successors, (75), 11 states have call predecessors, (75), 13 states have return successors, (67), 16 states have call predecessors, (67), 15 states have call successors, (67) [2023-12-21 14:42:48,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:52,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:42:57,081 INFO L93 Difference]: Finished difference Result 2367 states and 3304 transitions. [2023-12-21 14:42:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 14:42:57,081 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.25) internal successors, (150), 21 states have internal predecessors, (150), 15 states have call successors, (75), 11 states have call predecessors, (75), 13 states have return successors, (67), 16 states have call predecessors, (67), 15 states have call successors, (67) Word has length 226 [2023-12-21 14:42:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:42:57,117 INFO L225 Difference]: With dead ends: 2367 [2023-12-21 14:42:57,117 INFO L226 Difference]: Without dead ends: 1537 [2023-12-21 14:42:57,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=723, Invalid=2699, Unknown=0, NotChecked=0, Total=3422 [2023-12-21 14:42:57,121 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1198 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 3908 mSolverCounterSat, 1128 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 5038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1128 IncrementalHoareTripleChecker+Valid, 3908 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-21 14:42:57,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1648 Invalid, 5038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1128 Valid, 3908 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2023-12-21 14:42:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2023-12-21 14:42:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1177. [2023-12-21 14:42:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 739 states have (on average 1.2354533152909337) internal successors, (913), 750 states have internal predecessors, (913), 310 states have call successors, (310), 91 states have call predecessors, (310), 127 states have return successors, (404), 335 states have call predecessors, (404), 310 states have call successors, (404) [2023-12-21 14:42:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1627 transitions. [2023-12-21 14:42:57,287 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1627 transitions. Word has length 226 [2023-12-21 14:42:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:42:57,290 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1627 transitions. [2023-12-21 14:42:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.25) internal successors, (150), 21 states have internal predecessors, (150), 15 states have call successors, (75), 11 states have call predecessors, (75), 13 states have return successors, (67), 16 states have call predecessors, (67), 15 states have call successors, (67) [2023-12-21 14:42:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1627 transitions. [2023-12-21 14:42:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-21 14:42:57,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:42:57,294 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:42:57,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 14:42:57,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 14:42:57,497 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:42:57,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:42:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash 858941862, now seen corresponding path program 1 times [2023-12-21 14:42:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:42:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234273678] [2023-12-21 14:42:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:42:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:42:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:42:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:42:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:42:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:42:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:42:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:42:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:42:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 14:42:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:42:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 14:42:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 14:42:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-21 14:42:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:42:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-21 14:42:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-21 14:42:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-21 14:42:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-21 14:42:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-21 14:42:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-21 14:42:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 14:42:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-21 14:42:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-21 14:42:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 14:42:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2023-12-21 14:42:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:42:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234273678] [2023-12-21 14:42:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234273678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:42:58,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:42:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 14:42:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960155620] [2023-12-21 14:42:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:42:58,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 14:42:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:42:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 14:42:58,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-21 14:42:58,797 INFO L87 Difference]: Start difference. First operand 1177 states and 1627 transitions. Second operand has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-21 14:43:02,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:06,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:09,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:43:12,180 INFO L93 Difference]: Finished difference Result 2481 states and 3441 transitions. [2023-12-21 14:43:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 14:43:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28) Word has length 219 [2023-12-21 14:43:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:43:12,185 INFO L225 Difference]: With dead ends: 2481 [2023-12-21 14:43:12,185 INFO L226 Difference]: Without dead ends: 1493 [2023-12-21 14:43:12,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2023-12-21 14:43:12,187 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 557 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 395 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-21 14:43:12,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 752 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1890 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2023-12-21 14:43:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2023-12-21 14:43:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1181. [2023-12-21 14:43:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 743 states have (on average 1.2328398384925976) internal successors, (916), 752 states have internal predecessors, (916), 310 states have call successors, (310), 91 states have call predecessors, (310), 127 states have return successors, (404), 337 states have call predecessors, (404), 310 states have call successors, (404) [2023-12-21 14:43:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1630 transitions. [2023-12-21 14:43:12,359 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1630 transitions. Word has length 219 [2023-12-21 14:43:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:43:12,359 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 1630 transitions. [2023-12-21 14:43:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (28), 5 states have call predecessors, (28), 3 states have return successors, (28), 6 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-21 14:43:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1630 transitions. [2023-12-21 14:43:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-21 14:43:12,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:43:12,362 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:43:12,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 14:43:12,362 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:43:12,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:43:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash 126974436, now seen corresponding path program 1 times [2023-12-21 14:43:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:43:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294650793] [2023-12-21 14:43:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:43:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:43:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:43:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:43:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:43:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:43:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:43:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:43:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:43:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:43:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:43:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:43:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-21 14:43:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-21 14:43:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 14:43:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 14:43:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-21 14:43:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:43:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:43:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-21 14:43:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-21 14:43:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-21 14:43:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-21 14:43:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-21 14:43:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-21 14:43:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 14:43:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-21 14:43:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-21 14:43:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 14:43:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2023-12-21 14:43:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:43:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294650793] [2023-12-21 14:43:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294650793] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:43:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654940641] [2023-12-21 14:43:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:43:14,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:43:14,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:43:14,061 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:43:14,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 14:43:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:43:15,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 1734 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-21 14:43:15,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:43:16,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-21 14:43:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-21 14:43:16,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-21 14:43:16,499 INFO L378 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 9 treesize of output 3 [2023-12-21 14:43:16,500 INFO L378 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 5 treesize of output 3 [2023-12-21 14:43:16,503 INFO L378 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 5 treesize of output 3 [2023-12-21 14:43:16,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-12-21 14:43:16,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 14:43:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 459 proven. 68 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-12-21 14:43:16,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:43:16,674 INFO L378 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 33 treesize of output 29 [2023-12-21 14:43:16,676 INFO L378 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 31 treesize of output 27 [2023-12-21 14:43:16,901 INFO L378 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 20 treesize of output 18 [2023-12-21 14:43:16,902 INFO L378 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 26 treesize of output 22 [2023-12-21 14:43:16,909 INFO L378 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 22 treesize of output 20 [2023-12-21 14:43:17,130 INFO L378 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 20 treesize of output 18 [2023-12-21 14:43:17,132 INFO L378 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 26 treesize of output 22 [2023-12-21 14:43:17,138 INFO L378 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 22 treesize of output 20 [2023-12-21 14:43:17,236 INFO L378 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 20 treesize of output 18 [2023-12-21 14:43:17,238 INFO L378 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 26 treesize of output 22 [2023-12-21 14:43:17,243 INFO L378 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 26 treesize of output 24 [2023-12-21 14:43:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2023-12-21 14:43:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654940641] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:43:17,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:43:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 15] total 43 [2023-12-21 14:43:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076186041] [2023-12-21 14:43:17,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:43:17,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 14:43:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:43:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 14:43:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1611, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 14:43:17,669 INFO L87 Difference]: Start difference. First operand 1181 states and 1630 transitions. Second operand has 43 states, 41 states have (on average 4.170731707317073) internal successors, (171), 38 states have internal predecessors, (171), 23 states have call successors, (71), 13 states have call predecessors, (71), 17 states have return successors, (71), 22 states have call predecessors, (71), 23 states have call successors, (71) [2023-12-21 14:43:21,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:26,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:32,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:35,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:39,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:43,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:45,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:49,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:53,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:43:57,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:44:01,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:44:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:44:08,726 INFO L93 Difference]: Finished difference Result 1351 states and 1846 transitions. [2023-12-21 14:44:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-21 14:44:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 4.170731707317073) internal successors, (171), 38 states have internal predecessors, (171), 23 states have call successors, (71), 13 states have call predecessors, (71), 17 states have return successors, (71), 22 states have call predecessors, (71), 23 states have call successors, (71) Word has length 219 [2023-12-21 14:44:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:44:08,729 INFO L225 Difference]: With dead ends: 1351 [2023-12-21 14:44:08,729 INFO L226 Difference]: Without dead ends: 738 [2023-12-21 14:44:08,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1056, Invalid=5264, Unknown=0, NotChecked=0, Total=6320 [2023-12-21 14:44:08,732 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 2541 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 3830 mSolverCounterSat, 2321 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 6160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2321 IncrementalHoareTripleChecker+Valid, 3830 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.3s IncrementalHoareTripleChecker+Time [2023-12-21 14:44:08,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 2385 Invalid, 6160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2321 Valid, 3830 Invalid, 9 Unknown, 0 Unchecked, 47.3s Time] [2023-12-21 14:44:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2023-12-21 14:44:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 684. [2023-12-21 14:44:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 429 states have (on average 1.1794871794871795) internal successors, (506), 435 states have internal predecessors, (506), 180 states have call successors, (180), 52 states have call predecessors, (180), 74 states have return successors, (226), 196 states have call predecessors, (226), 180 states have call successors, (226) [2023-12-21 14:44:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 912 transitions. [2023-12-21 14:44:08,867 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 912 transitions. Word has length 219 [2023-12-21 14:44:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:44:08,867 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 912 transitions. [2023-12-21 14:44:08,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 4.170731707317073) internal successors, (171), 38 states have internal predecessors, (171), 23 states have call successors, (71), 13 states have call predecessors, (71), 17 states have return successors, (71), 22 states have call predecessors, (71), 23 states have call successors, (71) [2023-12-21 14:44:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 912 transitions. [2023-12-21 14:44:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-21 14:44:08,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:44:08,869 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:44:08,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 14:44:09,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 14:44:09,093 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:44:09,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:44:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash 186643452, now seen corresponding path program 1 times [2023-12-21 14:44:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:44:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275500096] [2023-12-21 14:44:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:44:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:44:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:44:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:44:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:44:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:44:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 14:44:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:44:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 14:44:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:44:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:44:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:44:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:44:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:44:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:44:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:44:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 14:44:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:44:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:44:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:44:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-21 14:44:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-21 14:44:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-21 14:44:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-21 14:44:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-21 14:44:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-12-21 14:44:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-21 14:44:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 14:44:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-12-21 14:44:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-12-21 14:44:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 161 proven. 153 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2023-12-21 14:44:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:44:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275500096] [2023-12-21 14:44:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275500096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:44:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571751296] [2023-12-21 14:44:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:44:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:44:16,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:44:16,560 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:44:16,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 14:44:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:44:18,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 146 conjunts are in the unsatisfiable core [2023-12-21 14:44:18,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:44:18,956 INFO L378 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 11 treesize of output 7 [2023-12-21 14:44:18,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-12-21 14:44:18,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:44:18,970 INFO L378 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 29 treesize of output 22 [2023-12-21 14:44:19,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-21 14:44:19,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-21 14:44:20,176 INFO L378 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 25 treesize of output 17 [2023-12-21 14:44:20,740 INFO L378 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 25 treesize of output 17 [2023-12-21 14:44:21,461 INFO L378 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 28 treesize of output 24 [2023-12-21 14:44:21,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:44:21,471 INFO L378 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 26 treesize of output 30 [2023-12-21 14:44:22,019 INFO L378 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 43 treesize of output 36 [2023-12-21 14:44:22,049 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-12-21 14:44:22,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 52 [2023-12-21 14:44:25,670 INFO L378 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 51 treesize of output 40 [2023-12-21 14:44:25,734 INFO L349 Elim1Store]: treesize reduction 80, result has 27.3 percent of original size [2023-12-21 14:44:25,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 66 [2023-12-21 14:44:30,112 INFO L378 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 23 treesize of output 11 [2023-12-21 14:44:30,179 INFO L349 Elim1Store]: treesize reduction 87, result has 23.0 percent of original size [2023-12-21 14:44:30,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 50 [2023-12-21 14:44:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 248 proven. 504 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-12-21 14:44:30,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:44:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571751296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:44:33,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 14:44:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 48] total 87 [2023-12-21 14:44:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459769929] [2023-12-21 14:44:33,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 14:44:33,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-12-21 14:44:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:44:33,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-12-21 14:44:33,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=8276, Unknown=0, NotChecked=0, Total=8742 [2023-12-21 14:44:33,801 INFO L87 Difference]: Start difference. First operand 684 states and 912 transitions. Second operand has 87 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 71 states have internal predecessors, (168), 33 states have call successors, (62), 22 states have call predecessors, (62), 26 states have return successors, (64), 32 states have call predecessors, (64), 33 states have call successors, (64) [2023-12-21 14:44:39,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:44:40,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:44:42,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:44:46,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:44:51,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:44:56,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:00,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:01,444 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 [] [2023-12-21 14:45:02,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:07,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:11,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:15,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:18,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:22,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:24,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:25,148 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 [] [2023-12-21 14:45:27,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:28,384 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 [] [2023-12-21 14:45:29,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:30,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:32,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:34,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:38,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:42,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:46,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:45:51,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:45:55,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:46:20,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:24,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:37,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:41,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:45,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:50,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:54,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:46:58,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:02,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:06,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:11,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:28,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:32,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:36,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:40,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:44,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:48,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:53,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:47:57,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:01,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:05,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:10,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:14,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:18,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:40,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:44,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:48,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:52,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:48:56,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:18,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:23,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:27,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:31,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:35,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:40,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:44,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:49:49,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:06,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:11,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:25,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:29,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:42,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:46,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:52,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:50:56,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:51:00,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:51:05,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:51:09,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:51:13,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:51:17,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:51:21,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-12-21 14:51:22,873 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 14:51:22,911 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 14:51:23,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-21 14:51:24,112 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 14:51:24,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 313 SyntacticMatches, 13 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11413 ImplicationChecksByTransitivity, 113.9s TimeCoverageRelationStatistics Valid=3406, Invalid=31356, Unknown=20, NotChecked=0, Total=34782 [2023-12-21 14:51:24,165 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1464 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 6492 mSolverCounterSat, 1098 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 295.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 7651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 6492 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 305.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:51:24,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 2913 Invalid, 7651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 6492 Invalid, 60 Unknown, 0 Unchecked, 305.0s Time] [2023-12-21 14:51:24,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 14:51:24,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 14:51:24,167 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-21 14:51:24,170 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:51:24,171 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 14:51:24,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:51:24 BoogieIcfgContainer [2023-12-21 14:51:24,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 14:51:24,177 INFO L158 Benchmark]: Toolchain (without parser) took 850746.38ms. Allocated memory was 211.8MB in the beginning and 896.5MB in the end (delta: 684.7MB). Free memory was 175.8MB in the beginning and 504.8MB in the end (delta: -328.9MB). Peak memory consumption was 357.2MB. Max. memory is 8.0GB. [2023-12-21 14:51:24,177 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 14:51:24,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.30ms. Allocated memory is still 211.8MB. Free memory was 175.3MB in the beginning and 149.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-21 14:51:24,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.80ms. Allocated memory is still 211.8MB. Free memory was 149.5MB in the beginning and 144.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 14:51:24,178 INFO L158 Benchmark]: Boogie Preprocessor took 76.74ms. Allocated memory is still 211.8MB. Free memory was 144.3MB in the beginning and 136.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-21 14:51:24,178 INFO L158 Benchmark]: RCFGBuilder took 4919.01ms. Allocated memory is still 211.8MB. Free memory was 136.5MB in the beginning and 138.2MB in the end (delta: -1.7MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2023-12-21 14:51:24,178 INFO L158 Benchmark]: TraceAbstraction took 845241.09ms. Allocated memory was 211.8MB in the beginning and 896.5MB in the end (delta: 684.7MB). Free memory was 137.7MB in the beginning and 504.8MB in the end (delta: -367.1MB). Peak memory consumption was 318.7MB. Max. memory is 8.0GB. [2023-12-21 14:51:24,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-12-21 14:51:24,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.30ms. Allocated memory is still 211.8MB. Free memory was 175.3MB in the beginning and 149.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.80ms. Allocated memory is still 211.8MB. Free memory was 149.5MB in the beginning and 144.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.74ms. Allocated memory is still 211.8MB. Free memory was 144.3MB in the beginning and 136.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 4919.01ms. Allocated memory is still 211.8MB. Free memory was 136.5MB in the beginning and 138.2MB in the end (delta: -1.7MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * TraceAbstraction took 845241.09ms. Allocated memory was 211.8MB in the beginning and 896.5MB in the end (delta: 684.7MB). Free memory was 137.7MB in the beginning and 504.8MB in the end (delta: -367.1MB). Peak memory consumption was 318.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 542). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 845.2s, OverallIterations: 17, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 743.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 112 mSolverCounterUnknown, 16854 SdHoareTripleChecker+Valid, 612.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16606 mSDsluCounter, 32668 SdHoareTripleChecker+Invalid, 597.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28269 mSDsCounter, 13483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47112 IncrementalHoareTripleChecker+Invalid, 60708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13483 mSolverCounterUnsat, 4399 mSDtfsCounter, 47112 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5322 GetRequests, 4478 SyntacticMatches, 30 SemanticMatches, 814 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22955 ImplicationChecksByTransitivity, 182.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1181occurred in iteration=15, InterpolantAutomatonStates: 422, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1318 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 86.6s InterpolantComputationTime, 4922 NumberOfCodeBlocks, 4862 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6401 ConstructedInterpolants, 124 QuantifiedInterpolants, 38607 SizeOfPredicates, 103 NumberOfNonLiveVariables, 15790 ConjunctsInSsa, 508 ConjunctsInUnsatCore, 36 InterpolantComputations, 7 PerfectInterpolantSequences, 23793/24837 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