/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 true -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-20 04:00:10,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 04:00:10,905 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-20 04:00:10,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 04:00:10,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 04:00:10,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 04:00:10,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 04:00:10,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 04:00:10,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 04:00:10,923 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 04:00:10,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 04:00:10,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 04:00:10,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 04:00:10,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 04:00:10,924 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 04:00:10,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 04:00:10,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 04:00:10,925 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 04:00:10,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 04:00:10,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 04:00:10,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 04:00:10,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 04:00:10,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 04:00:10,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 04:00:10,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 04:00:10,927 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 04:00:10,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 04:00:10,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 04:00:10,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 04:00:10,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 04:00:10,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 04:00:10,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 04:00:10,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 04:00:10,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 04:00:10,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 04:00:10,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 04:00:10,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 04:00:10,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 04:00:10,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 04:00:10,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 04:00:10,930 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 04:00:10,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 04:00:10,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 04:00:10,931 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 -> true [2023-12-20 04:00:11,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 04:00:11,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 04:00:11,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 04:00:11,100 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 04:00:11,100 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 04:00:11,101 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-20 04:00:12,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 04:00:12,458 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 04:00:12,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2023-12-20 04:00:12,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cd69c402/8557e52dad1c4a11a17e58e24a439313/FLAGfded01aa2 [2023-12-20 04:00:12,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cd69c402/8557e52dad1c4a11a17e58e24a439313 [2023-12-20 04:00:12,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 04:00:12,487 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 04:00:12,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 04:00:12,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 04:00:12,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 04:00:12,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:12,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cbbcc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12, skipping insertion in model container [2023-12-20 04:00:12,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:12,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 04:00:12,755 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-20 04:00:12,852 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 04:00:12,867 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 04:00:12,885 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-20 04:00:12,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 04:00:12,948 INFO L206 MainTranslator]: Completed translation [2023-12-20 04:00:12,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12 WrapperNode [2023-12-20 04:00:12,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 04:00:12,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 04:00:12,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 04:00:12,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 04:00:12,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:12,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,018 INFO L138 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 546 [2023-12-20 04:00:13,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 04:00:13,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 04:00:13,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 04:00:13,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 04:00:13,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,071 INFO L175 MemorySlicer]: Split 114 memory accesses to 16 slices as follows [2, 7, 12, 8, 3, 8, 20, 12, 6, 10, 0, 10, 3, 3, 7, 3]. 18 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 0, 4, 3, 0, 3, 6, 6, 2, 2, 0, 2, 0, 0, 0, 0]. The 35 writes are split as follows [0, 1, 4, 2, 1, 2, 8, 3, 2, 4, 0, 4, 1, 1, 1, 1]. [2023-12-20 04:00:13,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 04:00:13,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 04:00:13,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 04:00:13,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 04:00:13,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (1/1) ... [2023-12-20 04:00:13,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 04:00:13,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:13,151 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-20 04:00:13,192 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-20 04:00:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-20 04:00:13,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-20 04:00:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-20 04:00:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-20 04:00:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-20 04:00:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-20 04:00:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-20 04:00:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-20 04:00:13,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-20 04:00:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-20 04:00:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-20 04:00:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-20 04:00:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-20 04:00:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-20 04:00:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-20 04:00:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-20 04:00:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-20 04:00:13,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-20 04:00:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-20 04:00:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-20 04:00:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-20 04:00:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-20 04:00:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 04:00:13,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 04:00:13,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-20 04:00:13,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2023-12-20 04:00:13,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-20 04:00:13,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-20 04:00:13,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-20 04:00:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-20 04:00:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-20 04:00:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-20 04:00:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-20 04:00:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-20 04:00:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-20 04:00:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-20 04:00:13,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-20 04:00:13,207 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-20 04:00:13,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-20 04:00:13,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-20 04:00:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-20 04:00:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-20 04:00:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-20 04:00:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-20 04:00:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-20 04:00:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-20 04:00:13,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-20 04:00:13,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-20 04:00:13,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-20 04:00:13,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-20 04:00:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 04:00:13,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 04:00:13,420 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 04:00:13,422 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 04:00:13,749 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2023-12-20 04:00:13,749 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-20 04:00:13,750 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-20 04:00:13,750 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-20 04:00:13,750 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-20 04:00:13,750 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-20 04:00:13,750 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-20 04:00:13,929 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 04:00:13,956 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 04:00:13,957 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 04:00:13,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 04:00:13 BoogieIcfgContainer [2023-12-20 04:00:13,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 04:00:13,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 04:00:13,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 04:00:13,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 04:00:13,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 04:00:12" (1/3) ... [2023-12-20 04:00:13,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bf62c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 04:00:13, skipping insertion in model container [2023-12-20 04:00:13,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:12" (2/3) ... [2023-12-20 04:00:13,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bf62c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 04:00:13, skipping insertion in model container [2023-12-20 04:00:13,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 04:00:13" (3/3) ... [2023-12-20 04:00:13,963 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2023-12-20 04:00:13,978 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 04:00:13,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 04:00:14,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 04:00:14,027 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;@4a97c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 04:00:14,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 04:00:14,031 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-20 04:00:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-20 04:00:14,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:14,044 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-20 04:00:14,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:14,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1941247954, now seen corresponding path program 1 times [2023-12-20 04:00:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382262915] [2023-12-20 04:00:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 04:00:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:00:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:00:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:00:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:00:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:00:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:00:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 04:00:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 04:00:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 04:00:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,536 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-20 04:00:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:14,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382262915] [2023-12-20 04:00:14,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382262915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 04:00:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730569166] [2023-12-20 04:00:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:14,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 04:00:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:14,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 04:00:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 04:00:14,582 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-20 04:00:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:14,722 INFO L93 Difference]: Finished difference Result 330 states and 562 transitions. [2023-12-20 04:00:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 04:00:14,724 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-20 04:00:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:14,737 INFO L225 Difference]: With dead ends: 330 [2023-12-20 04:00:14,737 INFO L226 Difference]: Without dead ends: 165 [2023-12-20 04:00:14,745 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-20 04:00:14,748 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:14,749 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.1s Time] [2023-12-20 04:00:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-20 04:00:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2023-12-20 04:00:14,812 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-20 04:00:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2023-12-20 04:00:14,816 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 71 [2023-12-20 04:00:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:14,816 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2023-12-20 04:00:14,816 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-20 04:00:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2023-12-20 04:00:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-20 04:00:14,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:14,820 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-20 04:00:14,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 04:00:14,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:14,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1410362118, now seen corresponding path program 1 times [2023-12-20 04:00:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656233914] [2023-12-20 04:00:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:00:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:00:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 04:00:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:00:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 04:00:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 04:00:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 04:00:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 04:00:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:00:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:00:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,106 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-20 04:00:15,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:15,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656233914] [2023-12-20 04:00:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656233914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:15,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:15,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 04:00:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646456552] [2023-12-20 04:00:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:15,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 04:00:15,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:15,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 04:00:15,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 04:00:15,113 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-20 04:00:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:15,174 INFO L93 Difference]: Finished difference Result 325 states and 504 transitions. [2023-12-20 04:00:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 04:00:15,174 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-20 04:00:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:15,179 INFO L225 Difference]: With dead ends: 325 [2023-12-20 04:00:15,179 INFO L226 Difference]: Without dead ends: 164 [2023-12-20 04:00:15,180 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-20 04:00:15,181 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-20 04:00:15,181 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-20 04:00:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-20 04:00:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-12-20 04:00:15,199 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-20 04:00:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2023-12-20 04:00:15,200 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 74 [2023-12-20 04:00:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:15,201 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2023-12-20 04:00:15,201 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-20 04:00:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2023-12-20 04:00:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-20 04:00:15,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:15,203 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-20 04:00:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 04:00:15,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:15,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 283034204, now seen corresponding path program 1 times [2023-12-20 04:00:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069087265] [2023-12-20 04:00:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:00:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:00:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 04:00:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 04:00:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 04:00:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:00:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 04:00:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 04:00:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 04:00:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-20 04:00:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,404 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-20 04:00:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069087265] [2023-12-20 04:00:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069087265] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400842633] [2023-12-20 04:00:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:15,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:15,422 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-20 04:00:15,460 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-20 04:00:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:15,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 04:00:15,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:15,764 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-20 04:00:15,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:00:15,801 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-20 04:00:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400842633] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:00:15,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:00:15,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-20 04:00:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020139643] [2023-12-20 04:00:15,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:00:15,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 04:00:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:15,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 04:00:15,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-20 04:00:15,803 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-20 04:00:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:15,848 INFO L93 Difference]: Finished difference Result 328 states and 508 transitions. [2023-12-20 04:00:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 04:00:15,849 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-20 04:00:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:15,850 INFO L225 Difference]: With dead ends: 328 [2023-12-20 04:00:15,850 INFO L226 Difference]: Without dead ends: 166 [2023-12-20 04:00:15,851 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-20 04:00:15,851 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-20 04:00:15,852 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-20 04:00:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-20 04:00:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-12-20 04:00:15,860 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-20 04:00:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2023-12-20 04:00:15,861 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 75 [2023-12-20 04:00:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:15,862 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2023-12-20 04:00:15,862 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-20 04:00:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2023-12-20 04:00:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-20 04:00:15,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:15,864 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-20 04:00:15,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 04:00:16,071 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-20 04:00:16,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:16,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash 799972892, now seen corresponding path program 2 times [2023-12-20 04:00:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854012536] [2023-12-20 04:00:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:00:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:00:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:00:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:00:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:00:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:00:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 04:00:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 04:00:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 04:00:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 04:00:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:16,262 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-20 04:00:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854012536] [2023-12-20 04:00:16,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854012536] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350221234] [2023-12-20 04:00:16,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 04:00:16,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:16,264 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-20 04:00:16,284 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-20 04:00:16,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-20 04:00:16,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 04:00:16,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 04:00:16,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:16,584 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-20 04:00:16,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-20 04:00:16,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 04:00:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350221234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:16,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 04:00:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2023-12-20 04:00:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091254570] [2023-12-20 04:00:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:16,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 04:00:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 04:00:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-20 04:00:16,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-20 04:00:22,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:22,851 INFO L93 Difference]: Finished difference Result 615 states and 974 transitions. [2023-12-20 04:00:22,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 04:00:22,852 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-20 04:00:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:22,866 INFO L225 Difference]: With dead ends: 615 [2023-12-20 04:00:22,866 INFO L226 Difference]: Without dead ends: 419 [2023-12-20 04:00:22,867 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-20 04:00:22,867 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 433 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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, 6.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:22,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1532 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-20 04:00:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-20 04:00:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-20 04:00:22,923 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-20 04:00:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 671 transitions. [2023-12-20 04:00:22,926 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 671 transitions. Word has length 77 [2023-12-20 04:00:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:22,926 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 671 transitions. [2023-12-20 04:00:22,926 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-20 04:00:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 671 transitions. [2023-12-20 04:00:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-20 04:00:22,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:22,931 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-20 04:00:22,937 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-20 04:00:23,131 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-20 04:00:23,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:23,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2128466925, now seen corresponding path program 1 times [2023-12-20 04:00:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762928640] [2023-12-20 04:00:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:00:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:00:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:00:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:00:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:00:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:00:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:00:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:00:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:00:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 04:00:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-20 04:00:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:00:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 04:00:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 04:00:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 04:00:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 04:00:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 04:00:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,578 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-20 04:00:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762928640] [2023-12-20 04:00:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762928640] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287473791] [2023-12-20 04:00:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:23,579 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-20 04:00:23,601 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-20 04:00:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:23,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 04:00:23,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:23,933 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-20 04:00:23,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:00:24,013 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-20 04:00:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287473791] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:00:24,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:00:24,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2023-12-20 04:00:24,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756167123] [2023-12-20 04:00:24,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:00:24,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 04:00:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:24,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 04:00:24,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-20 04:00:24,016 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-20 04:00:26,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:27,462 INFO L93 Difference]: Finished difference Result 850 states and 1369 transitions. [2023-12-20 04:00:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 04:00:27,463 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-20 04:00:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:27,466 INFO L225 Difference]: With dead ends: 850 [2023-12-20 04:00:27,466 INFO L226 Difference]: Without dead ends: 439 [2023-12-20 04:00:27,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-20 04:00:27,470 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 35 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:27,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 868 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-20 04:00:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-20 04:00:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 429. [2023-12-20 04:00:27,506 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-20 04:00:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 686 transitions. [2023-12-20 04:00:27,509 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 686 transitions. Word has length 138 [2023-12-20 04:00:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:27,510 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 686 transitions. [2023-12-20 04:00:27,510 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-20 04:00:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 686 transitions. [2023-12-20 04:00:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 04:00:27,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:27,515 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-20 04:00:27,534 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-20 04:00:27,723 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-20 04:00:27,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:27,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1776494291, now seen corresponding path program 1 times [2023-12-20 04:00:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110764232] [2023-12-20 04:00:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:00:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:00:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:00:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:00:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:00:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:00:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:00:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:00:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 04:00:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-20 04:00:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:00:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 04:00:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 04:00:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 04:00:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 04:00:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 04:00:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 04:00:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:28,359 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-20 04:00:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110764232] [2023-12-20 04:00:28,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110764232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:28,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:28,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 04:00:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332774481] [2023-12-20 04:00:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:28,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 04:00:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 04:00:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 04:00:28,361 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-20 04:00:31,430 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 [] [2023-12-20 04:00:35,441 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-20 04:00:39,452 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-20 04:00:42,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:44,731 INFO L93 Difference]: Finished difference Result 886 states and 1421 transitions. [2023-12-20 04:00:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 04:00:44,732 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-20 04:00:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:44,736 INFO L225 Difference]: With dead ends: 886 [2023-12-20 04:00:44,736 INFO L226 Difference]: Without dead ends: 608 [2023-12-20 04:00:44,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-12-20 04:00:44,738 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 322 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 159 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s 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, 15.9s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:44,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 760 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 845 Invalid, 2 Unknown, 0 Unchecked, 15.9s Time] [2023-12-20 04:00:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2023-12-20 04:00:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 590. [2023-12-20 04:00:44,820 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-20 04:00:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 944 transitions. [2023-12-20 04:00:44,838 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 944 transitions. Word has length 144 [2023-12-20 04:00:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:44,840 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 944 transitions. [2023-12-20 04:00:44,840 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-20 04:00:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 944 transitions. [2023-12-20 04:00:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 04:00:44,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:44,843 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-20 04:00:44,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 04:00:44,843 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:44,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1863590095, now seen corresponding path program 2 times [2023-12-20 04:00:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507873159] [2023-12-20 04:00:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:00:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:00:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:00:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:00:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:00:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:00:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:00:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:00:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 04:00:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-20 04:00:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:00:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 04:00:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 04:00:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 04:00:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 04:00:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 04:00:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 04:00:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:45,451 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-20 04:00:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507873159] [2023-12-20 04:00:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507873159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:45,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:45,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 04:00:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947160197] [2023-12-20 04:00:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:45,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 04:00:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 04:00:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 04:00:45,454 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-20 04:00:48,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:50,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:52,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:56,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 [] [2023-12-20 04:00:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:59,149 INFO L93 Difference]: Finished difference Result 993 states and 1577 transitions. [2023-12-20 04:00:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 04:00:59,150 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-20 04:00:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:59,153 INFO L225 Difference]: With dead ends: 993 [2023-12-20 04:00:59,153 INFO L226 Difference]: Without dead ends: 585 [2023-12-20 04:00:59,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-20 04:00:59,156 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 280 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:59,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 852 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 651 Invalid, 1 Unknown, 0 Unchecked, 13.5s Time] [2023-12-20 04:00:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-20 04:00:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 567. [2023-12-20 04:00:59,185 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-20 04:00:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 883 transitions. [2023-12-20 04:00:59,188 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 883 transitions. Word has length 144 [2023-12-20 04:00:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:59,189 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 883 transitions. [2023-12-20 04:00:59,189 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-20 04:00:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 883 transitions. [2023-12-20 04:00:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 04:00:59,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:59,192 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-20 04:00:59,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 04:00:59,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:59,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 964601399, now seen corresponding path program 1 times [2023-12-20 04:00:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854650610] [2023-12-20 04:00:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:00:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:01:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:01:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:01:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:01:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:01:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:01:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:01:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 04:01:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-20 04:01:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:01:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 04:01:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-20 04:01:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 04:01:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 04:01:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 04:01:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 04:01:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:00,221 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-20 04:01:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:01:00,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854650610] [2023-12-20 04:01:00,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854650610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:01:00,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:01:00,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 04:01:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892512526] [2023-12-20 04:01:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:01:00,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 04:01:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:01:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 04:01:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 04:01:00,224 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-20 04:01:01,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:03,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:01:05,622 INFO L93 Difference]: Finished difference Result 814 states and 1267 transitions. [2023-12-20 04:01:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 04:01:05,623 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-20 04:01:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:01:05,626 INFO L225 Difference]: With dead ends: 814 [2023-12-20 04:01:05,626 INFO L226 Difference]: Without dead ends: 540 [2023-12-20 04:01:05,627 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-20 04:01:05,627 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 318 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:01:05,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 828 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-20 04:01:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-12-20 04:01:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 520. [2023-12-20 04:01:05,678 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-20 04:01:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 809 transitions. [2023-12-20 04:01:05,680 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 809 transitions. Word has length 144 [2023-12-20 04:01:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:01:05,680 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 809 transitions. [2023-12-20 04:01:05,681 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-20 04:01:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 809 transitions. [2023-12-20 04:01:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-20 04:01:05,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:01:05,684 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-20 04:01:05,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 04:01:05,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:01:05,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:01:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1204776282, now seen corresponding path program 1 times [2023-12-20 04:01:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:01:05,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010142969] [2023-12-20 04:01:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:01:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:01:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:01:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:01:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:01:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:01:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:01:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:01:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:01:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:01:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:01:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:01:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:01:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 04:01:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-20 04:01:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 04:01:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 04:01:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 04:01:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-12-20 04:01:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-20 04:01:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-20 04:01:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-20 04:01:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-20 04:01:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-20 04:01:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 04:01:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,455 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-20 04:01:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:01:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010142969] [2023-12-20 04:01:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010142969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:01:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83591333] [2023-12-20 04:01:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:01:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:01:06,456 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-20 04:01:06,458 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-20 04:01:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:06,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-20 04:01:06,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:01:06,985 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-20 04:01:07,268 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-20 04:01:07,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:01:07,925 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-20 04:01:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83591333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:01:07,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:01:07,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-12-20 04:01:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350522066] [2023-12-20 04:01:07,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:01:07,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 04:01:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:01:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 04:01:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2023-12-20 04:01:07,928 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-20 04:01:12,016 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-20 04:01:16,739 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-20 04:01:20,748 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-20 04:01:24,755 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-20 04:01:29,529 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-20 04:01:32,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:01:41,293 INFO L93 Difference]: Finished difference Result 1516 states and 2373 transitions. [2023-12-20 04:01:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-20 04:01:41,293 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-20 04:01:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:01:41,298 INFO L225 Difference]: With dead ends: 1516 [2023-12-20 04:01:41,298 INFO L226 Difference]: Without dead ends: 964 [2023-12-20 04:01:41,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1608, Invalid=6402, Unknown=0, NotChecked=0, Total=8010 [2023-12-20 04:01:41,302 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 1773 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 1293 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1293 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:01:41,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 2460 Invalid, 4545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1293 Valid, 3247 Invalid, 5 Unknown, 0 Unchecked, 29.0s Time] [2023-12-20 04:01:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-20 04:01:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 838. [2023-12-20 04:01:41,404 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-20 04:01:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1308 transitions. [2023-12-20 04:01:41,408 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1308 transitions. Word has length 197 [2023-12-20 04:01:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:01:41,408 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1308 transitions. [2023-12-20 04:01:41,408 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-20 04:01:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1308 transitions. [2023-12-20 04:01:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-20 04:01:41,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:01:41,412 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-20 04:01:41,421 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-20 04:01:41,621 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-20 04:01:41,621 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:01:41,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:01:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash -911884828, now seen corresponding path program 1 times [2023-12-20 04:01:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:01:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259473694] [2023-12-20 04:01:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:41,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:01:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:01:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:01:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:01:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:01:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:01:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:01:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:01:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:01:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:01:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:01:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:01:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:01:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 04:01:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-20 04:01:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 04:01:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 04:01:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 04:01:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-12-20 04:01:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-20 04:01:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-20 04:01:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-20 04:01:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-20 04:01:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-20 04:01:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 04:01:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:43,704 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-20 04:01:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:01:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259473694] [2023-12-20 04:01:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259473694] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:01:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571354850] [2023-12-20 04:01:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:43,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:01:43,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:01:43,706 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-20 04:01:43,708 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-20 04:01:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:44,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-20 04:01:44,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:01:44,440 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-20 04:01:55,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:01:55,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:01:55,615 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-20 04:01:59,781 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2023-12-20 04:01:59,782 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-20 04:02:24,202 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-20 04:02:24,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:02:24,353 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-20 04:02:24,357 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-20 04:02:24,770 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-20 04:02:24,772 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-20 04:02:24,828 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-20 04:02:24,839 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-20 04:02:24,950 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-20 04:02:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571354850] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:02:24,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:02:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 9] total 40 [2023-12-20 04:02:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516549826] [2023-12-20 04:02:24,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:02:24,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-20 04:02:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:02:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-20 04:02:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1405, Unknown=5, NotChecked=0, Total=1560 [2023-12-20 04:02:24,953 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-20 04:02:29,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:30,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:31,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:35,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:38,156 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-20 04:02:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:02:46,561 INFO L93 Difference]: Finished difference Result 1657 states and 2658 transitions. [2023-12-20 04:02:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-20 04:02:46,562 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-20 04:02:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:02:46,566 INFO L225 Difference]: With dead ends: 1657 [2023-12-20 04:02:46,566 INFO L226 Difference]: Without dead ends: 964 [2023-12-20 04:02:46,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 430 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=934, Invalid=4913, Unknown=5, NotChecked=0, Total=5852 [2023-12-20 04:02:46,570 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 1693 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 1641 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 6087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1641 IncrementalHoareTripleChecker+Valid, 4446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2023-12-20 04:02:46,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 2720 Invalid, 6087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1641 Valid, 4446 Invalid, 0 Unknown, 0 Unchecked, 18.8s Time] [2023-12-20 04:02:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-12-20 04:02:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 880. [2023-12-20 04:02:46,679 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-20 04:02:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1397 transitions. [2023-12-20 04:02:46,683 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1397 transitions. Word has length 197 [2023-12-20 04:02:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:02:46,684 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1397 transitions. [2023-12-20 04:02:46,684 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-20 04:02:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1397 transitions. [2023-12-20 04:02:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-20 04:02:46,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:02:46,689 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-20 04:02:46,700 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-20 04:02:46,898 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-20 04:02:46,898 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:02:46,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:02:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1627084640, now seen corresponding path program 1 times [2023-12-20 04:02:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:02:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623056761] [2023-12-20 04:02:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:02:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:02:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:02:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:02:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:02:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:02:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:02:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:02:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:02:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:02:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:48,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:02:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:02:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:02:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:02:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 04:02:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 04:02:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 04:02:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:02:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:02:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-20 04:02:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-12-20 04:02:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-20 04:02:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-20 04:02:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-20 04:02:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-12-20 04:02:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-12-20 04:02:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-12-20 04:02:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-20 04:02:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-20 04:02:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2023-12-20 04:02:49,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:02:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623056761] [2023-12-20 04:02:49,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623056761] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:02:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254099349] [2023-12-20 04:02:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:02:49,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:02:49,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:02:49,327 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-20 04:02:49,356 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-20 04:02:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:49,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-20 04:02:49,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:02:49,996 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-20 04:02:54,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:02:54,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:02:54,749 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-20 04:02:54,880 INFO L349 Elim1Store]: treesize reduction 48, result has 63.1 percent of original size [2023-12-20 04:02:54,880 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-20 04:02:55,154 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-20 04:02:55,176 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-20 04:02:55,176 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-20 04:02:55,210 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-20 04:02:55,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:02:55,247 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-20 04:02:55,389 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-20 04:02:55,782 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-20 04:02:55,883 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-20 04:02:56,097 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-20 04:02:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254099349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:02:56,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:02:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 13] total 36 [2023-12-20 04:02:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487989937] [2023-12-20 04:02:56,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:02:56,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-20 04:02:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:02:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-20 04:02:56,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1113, Unknown=2, NotChecked=0, Total=1260 [2023-12-20 04:02:56,100 INFO L87 Difference]: Start difference. First operand 880 states and 1397 transitions. Second operand has 36 states, 35 states have (on average 3.914285714285714) internal successors, (137), 30 states have internal predecessors, (137), 17 states have call successors, (68), 13 states have call predecessors, (68), 14 states have return successors, (61), 15 states have call predecessors, (61), 17 states have call successors, (61) [2023-12-20 04:03:00,241 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-20 04:03:04,312 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-20 04:03:08,446 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 [0] [2023-12-20 04:03:12,456 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-20 04:03:16,462 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-20 04:03:21,695 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-20 04:03:25,762 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-20 04:03:27,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:03:29,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-20 04:03:39,227 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-20 04:03:43,243 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-20 04:03:46,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:03:50,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:03:52,127 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-20 04:03:53,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:03:54,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:03:58,417 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-20 04:04:00,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:04,724 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-20 04:04:08,730 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-20 04:04:10,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:14,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:17,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:20,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:23,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:25,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:28,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:29,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:04:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:04:34,791 INFO L93 Difference]: Finished difference Result 2110 states and 3307 transitions. [2023-12-20 04:04:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-20 04:04:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.914285714285714) internal successors, (137), 30 states have internal predecessors, (137), 17 states have call successors, (68), 13 states have call predecessors, (68), 14 states have return successors, (61), 15 states have call predecessors, (61), 17 states have call successors, (61) Word has length 218 [2023-12-20 04:04:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:04:34,796 INFO L225 Difference]: With dead ends: 2110 [2023-12-20 04:04:34,797 INFO L226 Difference]: Without dead ends: 1269 [2023-12-20 04:04:34,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 488 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=1350, Invalid=7388, Unknown=4, NotChecked=0, Total=8742 [2023-12-20 04:04:34,801 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 2193 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 7979 mSolverCounterSat, 2057 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 5151 SdHoareTripleChecker+Invalid, 10056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2057 IncrementalHoareTripleChecker+Valid, 7979 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.6s IncrementalHoareTripleChecker+Time [2023-12-20 04:04:34,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 5151 Invalid, 10056 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2057 Valid, 7979 Invalid, 20 Unknown, 0 Unchecked, 85.6s Time] [2023-12-20 04:04:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2023-12-20 04:04:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1168. [2023-12-20 04:04:34,972 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-20 04:04:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1726 transitions. [2023-12-20 04:04:34,981 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1726 transitions. Word has length 218 [2023-12-20 04:04:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:04:34,982 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1726 transitions. [2023-12-20 04:04:34,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.914285714285714) internal successors, (137), 30 states have internal predecessors, (137), 17 states have call successors, (68), 13 states have call predecessors, (68), 14 states have return successors, (61), 15 states have call predecessors, (61), 17 states have call successors, (61) [2023-12-20 04:04:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1726 transitions. [2023-12-20 04:04:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-20 04:04:34,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:04:34,988 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-20 04:04:35,014 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-20 04:04:35,198 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-20 04:04:35,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:04:35,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:04:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1514444877, now seen corresponding path program 1 times [2023-12-20 04:04:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:04:35,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386710160] [2023-12-20 04:04:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:04:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:04:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:04:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:04:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:04:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:04:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:04:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:04:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:04:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:04:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:04:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:04:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:04:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:04:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 04:04:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:04:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:04:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:04:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:04:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:04:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:04:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-20 04:04:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 04:04:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-20 04:04:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-20 04:04:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-20 04:04:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-20 04:04:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-20 04:04:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-20 04:04:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-20 04:04:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-20 04:04:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2023-12-20 04:04:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:04:36,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386710160] [2023-12-20 04:04:36,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386710160] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:04:36,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686923844] [2023-12-20 04:04:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:04:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:04:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:04:36,512 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-20 04:04:36,514 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-20 04:04:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:37,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-20 04:04:37,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:04:37,221 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-20 04:04:37,311 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-20 04:04:37,360 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 11 treesize of output 7 [2023-12-20 04:04:37,364 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-20 04:04:37,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:04:37,458 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-20 04:04:37,551 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-20 04:04:37,708 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-20 04:04:37,781 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-20 04:04:37,962 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-20 04:04:37,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686923844] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:04:37,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:04:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 33 [2023-12-20 04:04:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608728715] [2023-12-20 04:04:37,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:04:37,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-20 04:04:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:04:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-20 04:04:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2023-12-20 04:04:37,965 INFO L87 Difference]: Start difference. First operand 1168 states and 1726 transitions. Second operand has 33 states, 31 states have (on average 5.612903225806452) internal successors, (174), 27 states have internal predecessors, (174), 19 states have call successors, (79), 11 states have call predecessors, (79), 11 states have return successors, (79), 16 states have call predecessors, (79), 19 states have call successors, (79) [2023-12-20 04:04:42,106 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-20 04:04:46,113 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-20 04:04:50,277 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-20 04:04:54,375 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-20 04:04:58,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:02,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-20 04:05:04,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:08,974 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-20 04:05:13,132 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-20 04:05:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:05:20,996 INFO L93 Difference]: Finished difference Result 1807 states and 2692 transitions. [2023-12-20 04:05:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-20 04:05:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 5.612903225806452) internal successors, (174), 27 states have internal predecessors, (174), 19 states have call successors, (79), 11 states have call predecessors, (79), 11 states have return successors, (79), 16 states have call predecessors, (79), 19 states have call successors, (79) Word has length 245 [2023-12-20 04:05:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:05:21,014 INFO L225 Difference]: With dead ends: 1807 [2023-12-20 04:05:21,015 INFO L226 Difference]: Without dead ends: 815 [2023-12-20 04:05:21,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1205, Invalid=5601, Unknown=0, NotChecked=0, Total=6806 [2023-12-20 04:05:21,019 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 1758 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 5174 mSolverCounterSat, 1583 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 3494 SdHoareTripleChecker+Invalid, 6764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1583 IncrementalHoareTripleChecker+Valid, 5174 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:05:21,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 3494 Invalid, 6764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1583 Valid, 5174 Invalid, 7 Unknown, 0 Unchecked, 39.1s Time] [2023-12-20 04:05:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2023-12-20 04:05:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 746. [2023-12-20 04:05:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 465 states have (on average 1.3225806451612903) internal successors, (615), 478 states have internal predecessors, (615), 209 states have call successors, (209), 56 states have call predecessors, (209), 71 states have return successors, (253), 211 states have call predecessors, (253), 209 states have call successors, (253) [2023-12-20 04:05:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1077 transitions. [2023-12-20 04:05:21,126 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1077 transitions. Word has length 245 [2023-12-20 04:05:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:05:21,126 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1077 transitions. [2023-12-20 04:05:21,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 5.612903225806452) internal successors, (174), 27 states have internal predecessors, (174), 19 states have call successors, (79), 11 states have call predecessors, (79), 11 states have return successors, (79), 16 states have call predecessors, (79), 19 states have call successors, (79) [2023-12-20 04:05:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1077 transitions. [2023-12-20 04:05:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-20 04:05:21,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:05:21,131 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-20 04:05:21,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-20 04:05:21,340 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-20 04:05:21,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:05:21,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:05:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1411923163, now seen corresponding path program 1 times [2023-12-20 04:05:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:05:21,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194581596] [2023-12-20 04:05:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:05:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:05:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:05:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:05:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:05:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:05:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:05:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:05:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:05:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:05:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:05:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:05:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:05:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 04:05:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:05:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:05:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:05:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:05:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:05:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:05:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-20 04:05:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 04:05:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-20 04:05:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-20 04:05:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-20 04:05:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-20 04:05:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-20 04:05:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-20 04:05:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-20 04:05:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-20 04:05:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:22,865 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-20 04:05:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:05:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194581596] [2023-12-20 04:05:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194581596] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:05:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643299257] [2023-12-20 04:05:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:05:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:05:22,867 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-20 04:05:22,880 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-20 04:05:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:23,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 104 conjunts are in the unsatisfiable core [2023-12-20 04:05:23,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:05:23,798 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-20 04:05:23,809 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-20 04:05:23,814 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-20 04:05:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:05:23,820 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-20 04:05:23,920 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-20 04:05:23,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:05:23,927 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-20 04:05:24,408 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-20 04:05:24,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:05:24,523 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-20 04:05:24,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:05:24,620 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-20 04:05:24,627 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-20 04:05:24,805 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-20 04:05:24,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:05:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643299257] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:05:25,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 04:05:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-12-20 04:05:25,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915948127] [2023-12-20 04:05:25,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 04:05:25,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-20 04:05:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:05:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-20 04:05:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2023-12-20 04:05:25,162 INFO L87 Difference]: Start difference. First operand 746 states and 1077 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-20 04:05:26,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:28,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:30,195 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-20 04:05:33,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:34,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:05:41,633 INFO L93 Difference]: Finished difference Result 1112 states and 1623 transitions. [2023-12-20 04:05:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-20 04:05:41,634 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-20 04:05:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:05:41,637 INFO L225 Difference]: With dead ends: 1112 [2023-12-20 04:05:41,637 INFO L226 Difference]: Without dead ends: 967 [2023-12-20 04:05:41,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=704, Invalid=3586, Unknown=0, NotChecked=0, Total=4290 [2023-12-20 04:05:41,641 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 1220 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 1064 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 3733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1064 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:05:41,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1863 Invalid, 3733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1064 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2023-12-20 04:05:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2023-12-20 04:05:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 814. [2023-12-20 04:05:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 504 states have (on average 1.2896825396825398) internal successors, (650), 520 states have internal predecessors, (650), 227 states have call successors, (227), 63 states have call predecessors, (227), 82 states have return successors, (276), 230 states have call predecessors, (276), 227 states have call successors, (276) [2023-12-20 04:05:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1153 transitions. [2023-12-20 04:05:41,786 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1153 transitions. Word has length 245 [2023-12-20 04:05:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:05:41,787 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1153 transitions. [2023-12-20 04:05:41,787 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-20 04:05:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1153 transitions. [2023-12-20 04:05:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-20 04:05:41,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:05:41,791 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-20 04:05:41,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 04:05:42,001 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-20 04:05:42,002 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:05:42,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:05:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash 577442656, now seen corresponding path program 1 times [2023-12-20 04:05:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:05:42,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598075915] [2023-12-20 04:05:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:05:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:05:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:05:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:05:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:05:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:05:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:05:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:05:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:05:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:05:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:05:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:05:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:05:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 04:05:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 04:05:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 04:05:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:05:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:05:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 04:05:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 04:05:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 04:05:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-20 04:05:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-20 04:05:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-12-20 04:05:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-20 04:05:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 04:05:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-12-20 04:05:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-12-20 04:05:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,228 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-20 04:05:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:05:43,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598075915] [2023-12-20 04:05:43,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598075915] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:05:43,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558003417] [2023-12-20 04:05:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:05:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:05:43,229 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-20 04:05:43,231 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-20 04:05:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:43,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-20 04:05:43,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:05:44,233 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-20 04:05:44,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:05:44,639 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-20 04:05:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558003417] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:05:44,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:05:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 7] total 27 [2023-12-20 04:05:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049584163] [2023-12-20 04:05:44,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:05:44,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-20 04:05:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:05:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-20 04:05:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2023-12-20 04:05:44,641 INFO L87 Difference]: Start difference. First operand 814 states and 1153 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-20 04:05:48,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 [] [2023-12-20 04:05:52,726 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-20 04:05:53,823 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-20 04:05:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:05:59,235 INFO L93 Difference]: Finished difference Result 2165 states and 3067 transitions. [2023-12-20 04:05:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-20 04:05:59,237 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-20 04:05:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:05:59,246 INFO L225 Difference]: With dead ends: 2165 [2023-12-20 04:05:59,246 INFO L226 Difference]: Without dead ends: 1400 [2023-12-20 04:05:59,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=723, Invalid=2699, Unknown=0, NotChecked=0, Total=3422 [2023-12-20 04:05:59,250 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 1215 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 4010 mSolverCounterSat, 1052 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 5064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 4010 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-12-20 04:05:59,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 1655 Invalid, 5064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 4010 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2023-12-20 04:05:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-12-20 04:05:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1133. [2023-12-20 04:05:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 713 states have (on average 1.246844319775596) internal successors, (889), 723 states have internal predecessors, (889), 301 states have call successors, (301), 85 states have call predecessors, (301), 118 states have return successors, (395), 324 states have call predecessors, (395), 301 states have call successors, (395) [2023-12-20 04:05:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1585 transitions. [2023-12-20 04:05:59,459 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1585 transitions. Word has length 226 [2023-12-20 04:05:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:05:59,462 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1585 transitions. [2023-12-20 04:05:59,462 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-20 04:05:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1585 transitions. [2023-12-20 04:05:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-20 04:05:59,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:05:59,466 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-20 04:05:59,492 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-20 04:05:59,675 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-20 04:05:59,676 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:05:59,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:05:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1447573540, now seen corresponding path program 1 times [2023-12-20 04:05:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:05:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697045466] [2023-12-20 04:05:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:05:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:06:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:06:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:06:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:06:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:06:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:06:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:06:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:06:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:06:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:06:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:06:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:06:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 04:06:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 04:06:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 04:06:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:06:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 04:06:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 04:06:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 04:06:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 04:06:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 04:06:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 04:06:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 04:06:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 04:06:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 04:06:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 04:06:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:02,407 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-20 04:06:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:06:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697045466] [2023-12-20 04:06:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697045466] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:06:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223500600] [2023-12-20 04:06:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:06:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:06:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:06:02,423 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-20 04:06:02,471 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-20 04:06:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:03,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 1748 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-20 04:06:03,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:06:03,426 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-20 04:06:03,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:06:03,550 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 21 treesize of output 15 [2023-12-20 04:06:03,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:06:03,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2023-12-20 04:06:03,896 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-20 04:06:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 481 proven. 87 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2023-12-20 04:06:03,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:06:03,979 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-20 04:06:04,147 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 162 treesize of output 158 [2023-12-20 04:06:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223500600] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:06:04,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 04:06:04,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2023-12-20 04:06:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512155542] [2023-12-20 04:06:04,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 04:06:04,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-20 04:06:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:06:04,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-20 04:06:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2023-12-20 04:06:04,411 INFO L87 Difference]: Start difference. First operand 1133 states and 1585 transitions. Second operand has 34 states, 32 states have (on average 4.125) internal successors, (132), 30 states have internal predecessors, (132), 16 states have call successors, (56), 11 states have call predecessors, (56), 12 states have return successors, (55), 14 states have call predecessors, (55), 16 states have call successors, (55) [2023-12-20 04:06:06,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:10,181 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-20 04:06:14,185 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-20 04:06:16,255 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-20 04:06:21,648 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-20 04:06:25,654 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-20 04:06:29,660 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-20 04:06:31,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:35,695 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-20 04:06:39,706 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-20 04:06:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:06:49,775 INFO L93 Difference]: Finished difference Result 2423 states and 3377 transitions. [2023-12-20 04:06:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-20 04:06:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.125) internal successors, (132), 30 states have internal predecessors, (132), 16 states have call successors, (56), 11 states have call predecessors, (56), 12 states have return successors, (55), 14 states have call predecessors, (55), 16 states have call successors, (55) Word has length 219 [2023-12-20 04:06:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:06:49,780 INFO L225 Difference]: With dead ends: 2423 [2023-12-20 04:06:49,780 INFO L226 Difference]: Without dead ends: 1616 [2023-12-20 04:06:49,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1343, Invalid=8163, Unknown=0, NotChecked=0, Total=9506 [2023-12-20 04:06:49,785 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 2547 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 8066 mSolverCounterSat, 2482 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 10555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2482 IncrementalHoareTripleChecker+Valid, 8066 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2023-12-20 04:06:49,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2567 Valid, 3856 Invalid, 10555 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2482 Valid, 8066 Invalid, 7 Unknown, 0 Unchecked, 40.5s Time] [2023-12-20 04:06:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2023-12-20 04:06:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1176. [2023-12-20 04:06:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 742 states have (on average 1.233153638814016) internal successors, (915), 749 states have internal predecessors, (915), 303 states have call successors, (303), 95 states have call predecessors, (303), 130 states have return successors, (395), 331 states have call predecessors, (395), 303 states have call successors, (395) [2023-12-20 04:06:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1613 transitions. [2023-12-20 04:06:49,983 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1613 transitions. Word has length 219 [2023-12-20 04:06:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:06:49,984 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1613 transitions. [2023-12-20 04:06:49,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.125) internal successors, (132), 30 states have internal predecessors, (132), 16 states have call successors, (56), 11 states have call predecessors, (56), 12 states have return successors, (55), 14 states have call predecessors, (55), 16 states have call successors, (55) [2023-12-20 04:06:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1613 transitions. [2023-12-20 04:06:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-20 04:06:49,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:06:49,987 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-20 04:06:50,010 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-20 04:06:50,198 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,SelfDestructingSolverStorable14 [2023-12-20 04:06:50,198 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:06:50,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:06:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash 858941862, now seen corresponding path program 1 times [2023-12-20 04:06:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:06:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079499185] [2023-12-20 04:06:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:06:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:06:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:06:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:06:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:06:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:06:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 04:06:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 04:06:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:06:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:06:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 04:06:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 04:06:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:06:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 04:06:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 04:06:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 04:06:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 04:06:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:06:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:06:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 04:06:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 04:06:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 04:06:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 04:06:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 04:06:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 04:06:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 04:06:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 04:06:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 04:06:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 04:06:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2023-12-20 04:06:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:06:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079499185] [2023-12-20 04:06:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079499185] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:06:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633337507] [2023-12-20 04:06:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:06:52,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:06:52,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:06:52,179 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-20 04:06:52,180 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-20 04:06:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:06:53,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 1745 conjuncts, 147 conjunts are in the unsatisfiable core [2023-12-20 04:06:53,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:06:53,736 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 44 treesize of output 38 [2023-12-20 04:06:53,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:06:53,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 22 [2023-12-20 04:06:53,862 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 10 treesize of output 8 [2023-12-20 04:06:54,523 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-20 04:06:54,655 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 18 treesize of output 14 [2023-12-20 04:06:55,253 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-20 04:06:55,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2023-12-20 04:06:55,260 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-20 04:06:55,266 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 19 treesize of output 12 [2023-12-20 04:06:55,550 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-20 04:06:55,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 96 [2023-12-20 04:06:55,560 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 9 treesize of output 7 [2023-12-20 04:06:55,813 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 65 treesize of output 60 [2023-12-20 04:06:55,858 INFO L349 Elim1Store]: treesize reduction 159, result has 20.5 percent of original size [2023-12-20 04:06:55,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 55 treesize of output 67 [2023-12-20 04:06:58,046 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-20 04:06:58,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 99 [2023-12-20 04:06:58,878 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 59 treesize of output 54 [2023-12-20 04:06:58,912 INFO L349 Elim1Store]: treesize reduction 143, result has 20.6 percent of original size [2023-12-20 04:06:58,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 51 treesize of output 63 [2023-12-20 04:07:04,403 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 59 treesize of output 54 [2023-12-20 04:07:04,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:07:04,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:07:04,441 INFO L349 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2023-12-20 04:07:04,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 63 [2023-12-20 04:07:18,865 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-20 04:07:18,866 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-20 04:07:18,889 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 101 [2023-12-20 04:07:18,889 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-20 04:07:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-20 04:07:19,067 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2023-12-20 04:07:19,070 INFO L158 Benchmark]: Toolchain (without parser) took 426583.79ms. Allocated memory was 314.6MB in the beginning and 606.1MB in the end (delta: 291.5MB). Free memory was 267.9MB in the beginning and 263.8MB in the end (delta: 4.1MB). Peak memory consumption was 296.0MB. Max. memory is 8.0GB. [2023-12-20 04:07:19,071 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 04:07:19,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.81ms. Allocated memory is still 314.6MB. Free memory was 267.9MB in the beginning and 242.1MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-20 04:07:19,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.40ms. Allocated memory is still 314.6MB. Free memory was 241.7MB in the beginning and 236.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 04:07:19,071 INFO L158 Benchmark]: Boogie Preprocessor took 105.48ms. Allocated memory is still 314.6MB. Free memory was 236.9MB in the beginning and 229.1MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-20 04:07:19,071 INFO L158 Benchmark]: RCFGBuilder took 832.02ms. Allocated memory is still 314.6MB. Free memory was 229.1MB in the beginning and 235.5MB in the end (delta: -6.4MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2023-12-20 04:07:19,071 INFO L158 Benchmark]: TraceAbstraction took 425111.77ms. Allocated memory was 314.6MB in the beginning and 606.1MB in the end (delta: 291.5MB). Free memory was 234.9MB in the beginning and 263.8MB in the end (delta: -28.8MB). Peak memory consumption was 262.1MB. Max. memory is 8.0GB. [2023-12-20 04:07:19,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 117.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.81ms. Allocated memory is still 314.6MB. Free memory was 267.9MB in the beginning and 242.1MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.40ms. Allocated memory is still 314.6MB. Free memory was 241.7MB in the beginning and 236.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 105.48ms. Allocated memory is still 314.6MB. Free memory was 236.9MB in the beginning and 229.1MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 832.02ms. Allocated memory is still 314.6MB. Free memory was 229.1MB in the beginning and 235.5MB in the end (delta: -6.4MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. * TraceAbstraction took 425111.77ms. Allocated memory was 314.6MB in the beginning and 606.1MB in the end (delta: 291.5MB). Free memory was 234.9MB in the beginning and 263.8MB in the end (delta: -28.8MB). Peak memory consumption was 262.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...