/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-pthread/cs_sync.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 14:37:20,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 14:37:21,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 14:37:21,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 14:37:21,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 14:37:21,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 14:37:21,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 14:37:21,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 14:37:21,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 14:37:21,066 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 14:37:21,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 14:37:21,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 14:37:21,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 14:37:21,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 14:37:21,068 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 14:37:21,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 14:37:21,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 14:37:21,068 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 14:37:21,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 14:37:21,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 14:37:21,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 14:37:21,070 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 14:37:21,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 14:37:21,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:37:21,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 14:37:21,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 14:37:21,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 14:37:21,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 14:37:21,073 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 14:37:21,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 14:37:21,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 14:37:21,073 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 14:37:21,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 14:37:21,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 14:37:21,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 14:37:21,283 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 14:37:21,283 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 14:37:21,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_sync.i [2023-12-21 14:37:22,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 14:37:22,607 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 14:37:22,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_sync.i [2023-12-21 14:37:22,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da260d566/2fe98a21a53c404c8052c00ca8487338/FLAG584a6e287 [2023-12-21 14:37:22,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da260d566/2fe98a21a53c404c8052c00ca8487338 [2023-12-21 14:37:22,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 14:37:22,641 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 14:37:22,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 14:37:22,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 14:37:22,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 14:37:22,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:37:22" (1/1) ... [2023-12-21 14:37:22,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff7aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:22, skipping insertion in model container [2023-12-21 14:37:22,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:37:22" (1/1) ... [2023-12-21 14:37:22,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 14:37:22,968 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_sync.i[34698,34711] [2023-12-21 14:37:23,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:37:23,074 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 14:37:23,104 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_sync.i[34698,34711] [2023-12-21 14:37:23,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:37:23,198 INFO L206 MainTranslator]: Completed translation [2023-12-21 14:37:23,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23 WrapperNode [2023-12-21 14:37:23,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 14:37:23,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 14:37:23,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 14:37:23,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 14:37:23,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,257 INFO L138 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2023-12-21 14:37:23,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 14:37:23,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 14:37:23,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 14:37:23,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 14:37:23,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,312 INFO L175 MemorySlicer]: Split 118 memory accesses to 16 slices as follows [2, 8, 3, 8, 20, 6, 16, 12, 3, 3, 7, 0, 12, 7, 8, 3]. 17 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 3, 0, 3, 6, 2, 6, 2, 0, 0, 0, 0, 2, 0, 4, 0]. The 36 writes are split as follows [0, 2, 1, 2, 8, 2, 5, 4, 1, 1, 1, 0, 5, 1, 2, 1]. [2023-12-21 14:37:23,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 14:37:23,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 14:37:23,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 14:37:23,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 14:37:23,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (1/1) ... [2023-12-21 14:37:23,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:37:23,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:23,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 14:37:23,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 14:37:23,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 14:37:23,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 14:37:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 14:37:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2023-12-21 14:37:23,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2023-12-21 14:37:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-21 14:37:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-21 14:37:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 14:37:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 14:37:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 14:37:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 14:37:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 14:37:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 14:37:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 14:37:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-21 14:37:23,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-21 14:37:23,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-21 14:37:23,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2023-12-21 14:37:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 14:37:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-21 14:37:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-21 14:37:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-21 14:37:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-21 14:37:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 14:37:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-21 14:37:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-21 14:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2023-12-21 14:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-21 14:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-21 14:37:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-21 14:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-21 14:37:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-21 14:37:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-21 14:37:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-21 14:37:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-21 14:37:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-21 14:37:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-21 14:37:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-21 14:37:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 14:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 14:37:23,767 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 14:37:23,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 14:37:24,048 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)); [2023-12-21 14:37:24,048 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-21 14:37:24,049 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-21 14:37:24,049 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-21 14:37:24,049 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2023-12-21 14:37:24,049 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-21 14:37:24,049 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-21 14:37:25,021 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 14:37:25,062 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 14:37:25,062 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 14:37:25,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:37:25 BoogieIcfgContainer [2023-12-21 14:37:25,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 14:37:25,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 14:37:25,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 14:37:25,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 14:37:25,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:37:22" (1/3) ... [2023-12-21 14:37:25,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3fb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:37:25, skipping insertion in model container [2023-12-21 14:37:25,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:37:23" (2/3) ... [2023-12-21 14:37:25,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3fb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:37:25, skipping insertion in model container [2023-12-21 14:37:25,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:37:25" (3/3) ... [2023-12-21 14:37:25,069 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2023-12-21 14:37:25,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 14:37:25,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 14:37:25,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 14:37:25,136 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;@261c0feb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 14:37:25,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 14:37:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-21 14:37:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-21 14:37:25,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:25,158 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:25,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:25,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1630962850, now seen corresponding path program 1 times [2023-12-21 14:37:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577008638] [2023-12-21 14:37:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 14:37:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 14:37:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 14:37:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 14:37:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-21 14:37:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 14:37:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 14:37:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 14:37:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:25,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577008638] [2023-12-21 14:37:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577008638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:25,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 14:37:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415388022] [2023-12-21 14:37:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:25,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 14:37:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 14:37:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:25,670 INFO L87 Difference]: Start difference. First operand has 180 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 114 states have internal predecessors, (170), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:25,795 INFO L93 Difference]: Finished difference Result 362 states and 611 transitions. [2023-12-21 14:37:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 14:37:25,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-12-21 14:37:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:25,807 INFO L225 Difference]: With dead ends: 362 [2023-12-21 14:37:25,807 INFO L226 Difference]: Without dead ends: 181 [2023-12-21 14:37:25,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:25,814 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:25,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 519 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 14:37:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-21 14:37:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2023-12-21 14:37:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 113 states have internal predecessors, (162), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-21 14:37:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2023-12-21 14:37:25,854 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 71 [2023-12-21 14:37:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:25,854 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2023-12-21 14:37:25,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2023-12-21 14:37:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 14:37:25,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:25,860 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:25,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 14:37:25,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:25,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -449082393, now seen corresponding path program 1 times [2023-12-21 14:37:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:25,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486480247] [2023-12-21 14:37:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:25,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:37:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:37:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 14:37:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 14:37:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 14:37:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 14:37:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-21 14:37:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:37:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-21 14:37:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-21 14:37:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:26,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486480247] [2023-12-21 14:37:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486480247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:26,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:26,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 14:37:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330403933] [2023-12-21 14:37:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:26,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 14:37:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 14:37:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:26,144 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:26,211 INFO L93 Difference]: Finished difference Result 357 states and 544 transitions. [2023-12-21 14:37:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 14:37:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2023-12-21 14:37:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:26,217 INFO L225 Difference]: With dead ends: 357 [2023-12-21 14:37:26,217 INFO L226 Difference]: Without dead ends: 180 [2023-12-21 14:37:26,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 14:37:26,218 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:26,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:37:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-21 14:37:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-12-21 14:37:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-21 14:37:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2023-12-21 14:37:26,244 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 74 [2023-12-21 14:37:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:26,245 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2023-12-21 14:37:26,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2023-12-21 14:37:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-21 14:37:26,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:26,249 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:26,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 14:37:26,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:26,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 761248113, now seen corresponding path program 1 times [2023-12-21 14:37:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:26,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675337675] [2023-12-21 14:37:26,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:26,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 14:37:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 14:37:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-21 14:37:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 14:37:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 14:37:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-21 14:37:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-21 14:37:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 14:37:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 14:37:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675337675] [2023-12-21 14:37:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675337675] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537060985] [2023-12-21 14:37:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:26,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:26,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:37:26,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 14:37:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:26,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 14:37:26,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:26,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:37:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-21 14:37:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537060985] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:37:26,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:37:26,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-21 14:37:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278356756] [2023-12-21 14:37:26,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:37:26,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 14:37:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:26,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 14:37:26,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-21 14:37:26,884 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 14:37:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:26,937 INFO L93 Difference]: Finished difference Result 360 states and 548 transitions. [2023-12-21 14:37:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 14:37:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 75 [2023-12-21 14:37:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:26,939 INFO L225 Difference]: With dead ends: 360 [2023-12-21 14:37:26,939 INFO L226 Difference]: Without dead ends: 182 [2023-12-21 14:37:26,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-21 14:37:26,940 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:26,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:37:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-21 14:37:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-12-21 14:37:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 116 states have internal predecessors, (165), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-21 14:37:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 275 transitions. [2023-12-21 14:37:26,950 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 275 transitions. Word has length 75 [2023-12-21 14:37:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:26,951 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 275 transitions. [2023-12-21 14:37:26,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 14:37:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 275 transitions. [2023-12-21 14:37:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 14:37:26,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:26,952 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:26,961 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-21 14:37:27,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:27,159 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:27,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1181732815, now seen corresponding path program 2 times [2023-12-21 14:37:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659766638] [2023-12-21 14:37:27,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 14:37:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 14:37:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 14:37:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-21 14:37:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:37:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:37:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 14:37:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 14:37:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 14:37:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-21 14:37:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-12-21 14:37:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659766638] [2023-12-21 14:37:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659766638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870239946] [2023-12-21 14:37:27,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 14:37:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:27,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:37:27,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 14:37:27,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 14:37:27,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 14:37:27,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 14:37:27,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:27,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 14:37:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-12-21 14:37:27,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 14:37:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870239946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 14:37:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2023-12-21 14:37:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692550844] [2023-12-21 14:37:27,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:27,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 14:37:27,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 14:37:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:37:27,857 INFO L87 Difference]: Start difference. First operand 182 states and 275 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:29,270 INFO L93 Difference]: Finished difference Result 679 states and 1054 transitions. [2023-12-21 14:37:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 14:37:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2023-12-21 14:37:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:29,274 INFO L225 Difference]: With dead ends: 679 [2023-12-21 14:37:29,275 INFO L226 Difference]: Without dead ends: 467 [2023-12-21 14:37:29,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 14:37:29,276 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 471 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:29,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1501 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-21 14:37:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-12-21 14:37:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2023-12-21 14:37:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 294 states have (on average 1.4591836734693877) internal successors, (429), 294 states have internal predecessors, (429), 142 states have call successors, (142), 30 states have call predecessors, (142), 30 states have return successors, (160), 142 states have call predecessors, (160), 142 states have call successors, (160) [2023-12-21 14:37:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 731 transitions. [2023-12-21 14:37:29,302 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 731 transitions. Word has length 77 [2023-12-21 14:37:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 731 transitions. [2023-12-21 14:37:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 14:37:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 731 transitions. [2023-12-21 14:37:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-21 14:37:29,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:29,305 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2023-12-21 14:37:29,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 14:37:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-21 14:37:29,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:29,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1813999782, now seen corresponding path program 1 times [2023-12-21 14:37:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383236854] [2023-12-21 14:37:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:37:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 14:37:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 14:37:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 14:37:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 14:37:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 14:37:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 14:37:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 14:37:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 14:37:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 14:37:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:37:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 14:37:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 14:37:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 14:37:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-21 14:37:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2023-12-21 14:37:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383236854] [2023-12-21 14:37:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383236854] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495706316] [2023-12-21 14:37:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:29,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:29,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:29,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:37:29,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 14:37:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:30,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 14:37:30,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2023-12-21 14:37:30,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:37:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2023-12-21 14:37:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495706316] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:37:30,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:37:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2023-12-21 14:37:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819611273] [2023-12-21 14:37:30,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:37:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 14:37:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 14:37:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-21 14:37:30,332 INFO L87 Difference]: Start difference. First operand 467 states and 731 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2023-12-21 14:37:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:32,431 INFO L93 Difference]: Finished difference Result 961 states and 1505 transitions. [2023-12-21 14:37:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 14:37:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 166 [2023-12-21 14:37:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:32,435 INFO L225 Difference]: With dead ends: 961 [2023-12-21 14:37:32,435 INFO L226 Difference]: Without dead ends: 502 [2023-12-21 14:37:32,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-21 14:37:32,437 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 62 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:32,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 650 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-21 14:37:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-21 14:37:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 477. [2023-12-21 14:37:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 302 states have (on average 1.4503311258278146) internal successors, (438), 304 states have internal predecessors, (438), 142 states have call successors, (142), 30 states have call predecessors, (142), 32 states have return successors, (164), 142 states have call predecessors, (164), 142 states have call successors, (164) [2023-12-21 14:37:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2023-12-21 14:37:32,500 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 166 [2023-12-21 14:37:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:32,500 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2023-12-21 14:37:32,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2023-12-21 14:37:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2023-12-21 14:37:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-21 14:37:32,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:32,504 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2023-12-21 14:37:32,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 14:37:32,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:32,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:32,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -874049946, now seen corresponding path program 1 times [2023-12-21 14:37:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264585566] [2023-12-21 14:37:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:32,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:37:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 14:37:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 14:37:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 14:37:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 14:37:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-21 14:37:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-21 14:37:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 14:37:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 14:37:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 14:37:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-12-21 14:37:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-21 14:37:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-12-21 14:37:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-21 14:37:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-12-21 14:37:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-12-21 14:37:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2023-12-21 14:37:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264585566] [2023-12-21 14:37:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264585566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:33,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 14:37:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507031657] [2023-12-21 14:37:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:33,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 14:37:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 14:37:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:37:33,460 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 14:37:35,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:37,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:38,614 INFO L93 Difference]: Finished difference Result 1127 states and 1756 transitions. [2023-12-21 14:37:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 14:37:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 186 [2023-12-21 14:37:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:38,617 INFO L225 Difference]: With dead ends: 1127 [2023-12-21 14:37:38,617 INFO L226 Difference]: Without dead ends: 642 [2023-12-21 14:37:38,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-21 14:37:38,619 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 424 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:38,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 935 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-21 14:37:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2023-12-21 14:37:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 611. [2023-12-21 14:37:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 382 states have (on average 1.3900523560209423) internal successors, (531), 386 states have internal predecessors, (531), 187 states have call successors, (187), 39 states have call predecessors, (187), 41 states have return successors, (213), 185 states have call predecessors, (213), 187 states have call successors, (213) [2023-12-21 14:37:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 931 transitions. [2023-12-21 14:37:38,657 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 931 transitions. Word has length 186 [2023-12-21 14:37:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:38,657 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 931 transitions. [2023-12-21 14:37:38,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 14:37:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 931 transitions. [2023-12-21 14:37:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-21 14:37:38,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:38,660 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2023-12-21 14:37:38,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 14:37:38,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:38,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1227929903, now seen corresponding path program 1 times [2023-12-21 14:37:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553252997] [2023-12-21 14:37:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:37:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 14:37:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 14:37:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 14:37:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-21 14:37:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-21 14:37:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-21 14:37:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-21 14:37:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-21 14:37:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 14:37:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-12-21 14:37:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-12-21 14:37:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-12-21 14:37:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-21 14:37:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-12-21 14:37:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-12-21 14:37:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2023-12-21 14:37:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553252997] [2023-12-21 14:37:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553252997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:39,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:37:39,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 14:37:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554159345] [2023-12-21 14:37:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:39,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 14:37:39,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 14:37:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 14:37:39,285 INFO L87 Difference]: Start difference. First operand 611 states and 931 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 14:37:43,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:44,662 INFO L93 Difference]: Finished difference Result 890 states and 1350 transitions. [2023-12-21 14:37:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 14:37:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 186 [2023-12-21 14:37:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:44,666 INFO L225 Difference]: With dead ends: 890 [2023-12-21 14:37:44,666 INFO L226 Difference]: Without dead ends: 631 [2023-12-21 14:37:44,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-12-21 14:37:44,667 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 438 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 318 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:44,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 864 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 712 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2023-12-21 14:37:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2023-12-21 14:37:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 600. [2023-12-21 14:37:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 376 states have (on average 1.3909574468085106) internal successors, (523), 382 states have internal predecessors, (523), 179 states have call successors, (179), 39 states have call predecessors, (179), 44 states have return successors, (210), 178 states have call predecessors, (210), 179 states have call successors, (210) [2023-12-21 14:37:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 912 transitions. [2023-12-21 14:37:44,699 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 912 transitions. Word has length 186 [2023-12-21 14:37:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:44,700 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 912 transitions. [2023-12-21 14:37:44,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 14:37:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 912 transitions. [2023-12-21 14:37:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 14:37:44,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:44,703 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2023-12-21 14:37:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 14:37:44,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:44,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 152137025, now seen corresponding path program 1 times [2023-12-21 14:37:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848263502] [2023-12-21 14:37:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:37:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:37:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 14:37:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 14:37:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-21 14:37:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 14:37:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 14:37:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-21 14:37:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 14:37:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 14:37:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 14:37:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:37:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 14:37:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-21 14:37:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-21 14:37:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-21 14:37:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-21 14:37:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2023-12-21 14:37:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848263502] [2023-12-21 14:37:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848263502] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439244464] [2023-12-21 14:37:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:46,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:46,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:46,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:37:46,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 14:37:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:46,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 14:37:46,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:46,706 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 6 treesize of output 5 [2023-12-21 14:37:46,710 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 6 treesize of output 5 [2023-12-21 14:37:46,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 14:37:46,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 14:37:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2023-12-21 14:37:46,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 14:37:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439244464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:37:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 14:37:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2023-12-21 14:37:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013605734] [2023-12-21 14:37:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:37:46,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 14:37:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:46,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 14:37:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-21 14:37:46,811 INFO L87 Difference]: Start difference. First operand 600 states and 912 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-21 14:37:50,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:37:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:37:51,089 INFO L93 Difference]: Finished difference Result 854 states and 1291 transitions. [2023-12-21 14:37:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 14:37:51,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 172 [2023-12-21 14:37:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:37:51,092 INFO L225 Difference]: With dead ends: 854 [2023-12-21 14:37:51,092 INFO L226 Difference]: Without dead ends: 581 [2023-12-21 14:37:51,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-21 14:37:51,093 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 279 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-21 14:37:51,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 829 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-21 14:37:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2023-12-21 14:37:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 569. [2023-12-21 14:37:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 356 states have (on average 1.398876404494382) internal successors, (498), 361 states have internal predecessors, (498), 171 states have call successors, (171), 36 states have call predecessors, (171), 41 states have return successors, (199), 171 states have call predecessors, (199), 171 states have call successors, (199) [2023-12-21 14:37:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 868 transitions. [2023-12-21 14:37:51,132 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 868 transitions. Word has length 172 [2023-12-21 14:37:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:37:51,132 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 868 transitions. [2023-12-21 14:37:51,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-21 14:37:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 868 transitions. [2023-12-21 14:37:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-21 14:37:51,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:37:51,136 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:37:51,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 14:37:51,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:51,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:37:51,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:37:51,357 INFO L85 PathProgramCache]: Analyzing trace with hash 750474776, now seen corresponding path program 1 times [2023-12-21 14:37:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:37:51,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802704041] [2023-12-21 14:37:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:37:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:37:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:37:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:37:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:37:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:37:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:37:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:37:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:37:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:37:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:37:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:37:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:37:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:37:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 14:37:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:37:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:37:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:37:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-21 14:37:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-21 14:37:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-21 14:37:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 14:37:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-21 14:37:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-21 14:37:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-21 14:37:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 14:37:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 14:37:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2023-12-21 14:37:52,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:37:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802704041] [2023-12-21 14:37:52,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802704041] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:37:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31587582] [2023-12-21 14:37:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:37:52,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:37:52,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:37:52,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:37:52,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 14:37:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:37:52,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 14:37:52,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:37:52,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 14:37:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 640 proven. 91 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2023-12-21 14:37:53,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:37:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-12-21 14:37:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31587582] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:37:53,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:37:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-12-21 14:37:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691275987] [2023-12-21 14:37:53,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:37:53,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 14:37:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:37:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 14:37:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2023-12-21 14:37:53,715 INFO L87 Difference]: Start difference. First operand 569 states and 868 transitions. Second operand has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 28 states have internal predecessors, (116), 17 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (63), 10 states have call predecessors, (63), 17 states have call successors, (63) [2023-12-21 14:37:57,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:02,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:06,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:10,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:15,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:18,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:38:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:38:25,928 INFO L93 Difference]: Finished difference Result 1655 states and 2537 transitions. [2023-12-21 14:38:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-21 14:38:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 28 states have internal predecessors, (116), 17 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (63), 10 states have call predecessors, (63), 17 states have call successors, (63) Word has length 245 [2023-12-21 14:38:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:38:25,935 INFO L225 Difference]: With dead ends: 1655 [2023-12-21 14:38:25,935 INFO L226 Difference]: Without dead ends: 1054 [2023-12-21 14:38:25,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2836 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1785, Invalid=7335, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 14:38:25,939 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 2102 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 1276 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 4806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1276 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2023-12-21 14:38:25,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 2061 Invalid, 4806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1276 Valid, 3527 Invalid, 3 Unknown, 0 Unchecked, 27.7s Time] [2023-12-21 14:38:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2023-12-21 14:38:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 914. [2023-12-21 14:38:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 568 states have (on average 1.408450704225352) internal successors, (800), 582 states have internal predecessors, (800), 269 states have call successors, (269), 66 states have call predecessors, (269), 76 states have return successors, (327), 265 states have call predecessors, (327), 269 states have call successors, (327) [2023-12-21 14:38:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1396 transitions. [2023-12-21 14:38:26,014 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1396 transitions. Word has length 245 [2023-12-21 14:38:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:38:26,014 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1396 transitions. [2023-12-21 14:38:26,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 28 states have internal predecessors, (116), 17 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (63), 10 states have call predecessors, (63), 17 states have call successors, (63) [2023-12-21 14:38:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1396 transitions. [2023-12-21 14:38:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-21 14:38:26,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:38:26,018 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:38:26,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 14:38:26,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:38:26,228 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:38:26,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:38:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1960362262, now seen corresponding path program 1 times [2023-12-21 14:38:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:38:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862130719] [2023-12-21 14:38:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:38:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:38:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:38:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:38:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:38:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:38:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:38:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:38:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:38:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:38:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:38:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:38:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:38:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:38:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-21 14:38:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:38:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:38:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:38:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-21 14:38:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-21 14:38:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-21 14:38:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 14:38:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-21 14:38:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-21 14:38:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-21 14:38:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 14:38:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 14:38:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2023-12-21 14:38:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:38:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862130719] [2023-12-21 14:38:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862130719] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:38:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82503215] [2023-12-21 14:38:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:38:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:38:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:38:28,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:38:28,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 14:38:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:38:28,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 14:38:28,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:38:29,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 14:38:35,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:38:35,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:38:35,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2023-12-21 14:38:36,693 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2023-12-21 14:38:36,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2023-12-21 14:39:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 1014 proven. 4 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2023-12-21 14:39:00,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:39:00,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-12-21 14:39:00,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-12-21 14:39:00,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-21 14:39:00,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-21 14:39:00,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-21 14:39:00,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-21 14:39:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2023-12-21 14:39:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82503215] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:39:01,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:39:01,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 9] total 40 [2023-12-21 14:39:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924309155] [2023-12-21 14:39:01,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:39:01,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-21 14:39:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:39:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-21 14:39:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1405, Unknown=5, NotChecked=0, Total=1560 [2023-12-21 14:39:01,076 INFO L87 Difference]: Start difference. First operand 914 states and 1396 transitions. Second operand has 40 states, 37 states have (on average 4.135135135135135) internal successors, (153), 36 states have internal predecessors, (153), 19 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) [2023-12-21 14:39:02,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:07,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:11,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:39:17,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:20,744 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-21 14:39:24,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:28,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:31,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:32,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:35,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:39:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:39:43,034 INFO L93 Difference]: Finished difference Result 1817 states and 2848 transitions. [2023-12-21 14:39:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-21 14:39:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.135135135135135) internal successors, (153), 36 states have internal predecessors, (153), 19 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) Word has length 245 [2023-12-21 14:39:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:39:43,050 INFO L225 Difference]: With dead ends: 1817 [2023-12-21 14:39:43,050 INFO L226 Difference]: Without dead ends: 1056 [2023-12-21 14:39:43,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 542 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=1013, Invalid=5302, Unknown=5, NotChecked=0, Total=6320 [2023-12-21 14:39:43,064 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 1731 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 5323 mSolverCounterSat, 1412 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 6739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1412 IncrementalHoareTripleChecker+Valid, 5323 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2023-12-21 14:39:43,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 2759 Invalid, 6739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1412 Valid, 5323 Invalid, 4 Unknown, 0 Unchecked, 38.5s Time] [2023-12-21 14:39:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2023-12-21 14:39:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 954. [2023-12-21 14:39:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 591 states have (on average 1.4077834179357023) internal successors, (832), 606 states have internal predecessors, (832), 283 states have call successors, (283), 66 states have call predecessors, (283), 79 states have return successors, (366), 281 states have call predecessors, (366), 283 states have call successors, (366) [2023-12-21 14:39:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1481 transitions. [2023-12-21 14:39:43,240 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1481 transitions. Word has length 245 [2023-12-21 14:39:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:39:43,256 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1481 transitions. [2023-12-21 14:39:43,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.135135135135135) internal successors, (153), 36 states have internal predecessors, (153), 19 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) [2023-12-21 14:39:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1481 transitions. [2023-12-21 14:39:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-12-21 14:39:43,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:39:43,265 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:39:43,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 14:39:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:39:43,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:39:43,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:39:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1016844618, now seen corresponding path program 1 times [2023-12-21 14:39:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:39:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431741860] [2023-12-21 14:39:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:39:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:39:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:39:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:39:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:39:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:39:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:39:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:39:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:39:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:39:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:39:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:39:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:39:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:39:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:39:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-21 14:39:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:39:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:39:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-21 14:39:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 14:39:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 14:39:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-21 14:39:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-21 14:39:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-21 14:39:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-21 14:39:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 14:39:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-21 14:39:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-21 14:39:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2023-12-21 14:39:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:39:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431741860] [2023-12-21 14:39:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431741860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:39:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334839200] [2023-12-21 14:39:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:39:43,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:39:43,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:39:43,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:39:43,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 14:39:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:44,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 14:39:44,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:39:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2023-12-21 14:39:44,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 14:39:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334839200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:39:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 14:39:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-12-21 14:39:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684623105] [2023-12-21 14:39:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:39:44,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 14:39:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:39:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 14:39:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 14:39:44,603 INFO L87 Difference]: Start difference. First operand 954 states and 1481 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-21 14:39:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:39:44,749 INFO L93 Difference]: Finished difference Result 1836 states and 2954 transitions. [2023-12-21 14:39:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 14:39:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 272 [2023-12-21 14:39:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:39:44,755 INFO L225 Difference]: With dead ends: 1836 [2023-12-21 14:39:44,755 INFO L226 Difference]: Without dead ends: 962 [2023-12-21 14:39:44,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 14:39:44,759 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:39:44,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 512 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:39:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-12-21 14:39:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2023-12-21 14:39:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 599 states have (on average 1.4023372287145242) internal successors, (840), 614 states have internal predecessors, (840), 283 states have call successors, (283), 66 states have call predecessors, (283), 79 states have return successors, (366), 281 states have call predecessors, (366), 283 states have call successors, (366) [2023-12-21 14:39:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1489 transitions. [2023-12-21 14:39:44,863 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1489 transitions. Word has length 272 [2023-12-21 14:39:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:39:44,863 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1489 transitions. [2023-12-21 14:39:44,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-21 14:39:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1489 transitions. [2023-12-21 14:39:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-12-21 14:39:44,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:39:44,869 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:39:44,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 14:39:45,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:39:45,078 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:39:45,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:39:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash -825631096, now seen corresponding path program 1 times [2023-12-21 14:39:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:39:45,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105559235] [2023-12-21 14:39:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:39:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:39:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:39:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:39:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:39:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:39:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:39:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:39:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:39:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:39:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:39:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:39:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:39:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:39:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:39:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-21 14:39:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:39:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:39:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:39:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:39:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-21 14:39:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 14:39:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-21 14:39:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-21 14:39:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-21 14:39:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-21 14:39:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-21 14:39:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 14:39:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-21 14:39:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-21 14:39:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2023-12-21 14:39:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:39:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105559235] [2023-12-21 14:39:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105559235] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:39:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482725269] [2023-12-21 14:39:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:39:47,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:39:47,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:39:47,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:39:47,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 14:39:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:39:48,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 1890 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 14:39:48,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:39:48,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 14:39:53,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:39:53,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:39:53,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2023-12-21 14:39:53,512 INFO L349 Elim1Store]: treesize reduction 48, result has 63.1 percent of original size [2023-12-21 14:39:53,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 106 [2023-12-21 14:39:53,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 14:39:53,825 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 14:39:53,826 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 29 treesize of output 21 [2023-12-21 14:39:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 1050 proven. 121 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2023-12-21 14:39:53,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:39:53,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-21 14:39:53,961 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 138 treesize of output 134 [2023-12-21 14:39:54,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-21 14:39:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-21 14:39:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1762 trivial. 0 not checked. [2023-12-21 14:39:54,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482725269] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 14:39:54,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 14:39:54,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 13] total 42 [2023-12-21 14:39:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858400002] [2023-12-21 14:39:54,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 14:39:54,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-21 14:39:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:39:54,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-21 14:39:54,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1556, Unknown=2, NotChecked=0, Total=1722 [2023-12-21 14:39:54,464 INFO L87 Difference]: Start difference. First operand 962 states and 1489 transitions. Second operand has 42 states, 40 states have (on average 4.05) internal successors, (162), 36 states have internal predecessors, (162), 21 states have call successors, (73), 13 states have call predecessors, (73), 15 states have return successors, (73), 18 states have call predecessors, (73), 21 states have call successors, (73) [2023-12-21 14:39:58,679 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, 1] [2023-12-21 14:40:02,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:04,272 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 [0] [2023-12-21 14:40:08,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:12,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:16,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:17,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:21,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:25,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:29,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:33,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:38,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:43,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:47,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:51,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 14:40:56,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 14:41:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:41:12,476 INFO L93 Difference]: Finished difference Result 2556 states and 3831 transitions. [2023-12-21 14:41:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-12-21 14:41:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 4.05) internal successors, (162), 36 states have internal predecessors, (162), 21 states have call successors, (73), 13 states have call predecessors, (73), 15 states have return successors, (73), 18 states have call predecessors, (73), 21 states have call successors, (73) Word has length 272 [2023-12-21 14:41:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:41:12,483 INFO L225 Difference]: With dead ends: 2556 [2023-12-21 14:41:12,483 INFO L226 Difference]: Without dead ends: 1637 [2023-12-21 14:41:12,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 620 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4715 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2460, Invalid=14308, Unknown=2, NotChecked=0, Total=16770 [2023-12-21 14:41:12,489 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 3331 mSDsluCounter, 5951 mSDsCounter, 0 mSdLazyCounter, 12186 mSolverCounterSat, 3100 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3331 SdHoareTripleChecker+Valid, 6450 SdHoareTripleChecker+Invalid, 15299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3100 IncrementalHoareTripleChecker+Valid, 12186 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.5s IncrementalHoareTripleChecker+Time [2023-12-21 14:41:12,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3331 Valid, 6450 Invalid, 15299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3100 Valid, 12186 Invalid, 13 Unknown, 0 Unchecked, 69.5s Time] [2023-12-21 14:41:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2023-12-21 14:41:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1239. [2023-12-21 14:41:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 768 states have (on average 1.2916666666666667) internal successors, (992), 784 states have internal predecessors, (992), 356 states have call successors, (356), 93 states have call predecessors, (356), 114 states have return successors, (426), 361 states have call predecessors, (426), 356 states have call successors, (426) [2023-12-21 14:41:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1774 transitions. [2023-12-21 14:41:12,674 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1774 transitions. Word has length 272 [2023-12-21 14:41:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:41:12,674 INFO L495 AbstractCegarLoop]: Abstraction has 1239 states and 1774 transitions. [2023-12-21 14:41:12,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 4.05) internal successors, (162), 36 states have internal predecessors, (162), 21 states have call successors, (73), 13 states have call predecessors, (73), 15 states have return successors, (73), 18 states have call predecessors, (73), 21 states have call successors, (73) [2023-12-21 14:41:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1774 transitions. [2023-12-21 14:41:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-21 14:41:12,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:41:12,679 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:41:12,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-21 14:41:12,888 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,SelfDestructingSolverStorable11 [2023-12-21 14:41:12,889 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:41:12,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:41:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash 930819993, now seen corresponding path program 1 times [2023-12-21 14:41:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:41:12,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015092323] [2023-12-21 14:41:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:41:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:41:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:41:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:41:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:41:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:41:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:41:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:41:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:41:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:41:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:41:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:41:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:41:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:41:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:41:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-21 14:41:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:41:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:41:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 14:41:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-21 14:41:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-12-21 14:41:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 14:41:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-21 14:41:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 14:41:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 14:41:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-21 14:41:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 14:41:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 14:41:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 1727 trivial. 0 not checked. [2023-12-21 14:41:14,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:41:14,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015092323] [2023-12-21 14:41:14,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015092323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:41:14,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:41:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 14:41:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360704116] [2023-12-21 14:41:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:41:14,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 14:41:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:41:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 14:41:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-21 14:41:14,610 INFO L87 Difference]: Start difference. First operand 1239 states and 1774 transitions. Second operand has 12 states, 10 states have (on average 7.1) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-21 14:41:18,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:22,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:24,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:41:26,767 INFO L93 Difference]: Finished difference Result 2503 states and 3546 transitions. [2023-12-21 14:41:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 14:41:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) Word has length 273 [2023-12-21 14:41:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:41:26,774 INFO L225 Difference]: With dead ends: 2503 [2023-12-21 14:41:26,774 INFO L226 Difference]: Without dead ends: 1471 [2023-12-21 14:41:26,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2023-12-21 14:41:26,777 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 296 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 205 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-12-21 14:41:26,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 582 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1223 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2023-12-21 14:41:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2023-12-21 14:41:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1303. [2023-12-21 14:41:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 813 states have (on average 1.2767527675276753) internal successors, (1038), 832 states have internal predecessors, (1038), 365 states have call successors, (365), 98 states have call predecessors, (365), 124 states have return successors, (445), 372 states have call predecessors, (445), 365 states have call successors, (445) [2023-12-21 14:41:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1848 transitions. [2023-12-21 14:41:26,988 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1848 transitions. Word has length 273 [2023-12-21 14:41:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:41:26,988 INFO L495 AbstractCegarLoop]: Abstraction has 1303 states and 1848 transitions. [2023-12-21 14:41:26,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (30), 5 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-21 14:41:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1848 transitions. [2023-12-21 14:41:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-21 14:41:26,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:41:26,992 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:41:26,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 14:41:26,993 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:41:26,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:41:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1726987424, now seen corresponding path program 1 times [2023-12-21 14:41:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:41:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195966521] [2023-12-21 14:41:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:41:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:41:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:28,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:41:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:41:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:41:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:41:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:41:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:41:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:41:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:41:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:41:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:41:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:41:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:41:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:41:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-21 14:41:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:41:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:41:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:41:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:41:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 14:41:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-21 14:41:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-12-21 14:41:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 14:41:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-21 14:41:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 14:41:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 14:41:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-21 14:41:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 14:41:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 14:41:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2023-12-21 14:41:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:41:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195966521] [2023-12-21 14:41:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195966521] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:41:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575153028] [2023-12-21 14:41:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:41:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:41:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:41:29,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:41:29,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 14:41:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:41:30,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 1853 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-21 14:41:30,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:41:30,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 14:41:31,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 14:41:31,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:41:31,076 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-21 14:41:31,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 14:41:31,730 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-21 14:41:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1073 proven. 227 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2023-12-21 14:41:31,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 14:41:31,907 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 24 treesize of output 20 [2023-12-21 14:41:32,309 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 72 treesize of output 70 [2023-12-21 14:41:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575153028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:41:33,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 14:41:33,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 41 [2023-12-21 14:41:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996090776] [2023-12-21 14:41:33,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 14:41:33,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 14:41:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:41:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 14:41:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2699, Unknown=0, NotChecked=0, Total=2970 [2023-12-21 14:41:33,081 INFO L87 Difference]: Start difference. First operand 1303 states and 1848 transitions. Second operand has 41 states, 39 states have (on average 3.8974358974358974) internal successors, (152), 37 states have internal predecessors, (152), 20 states have call successors, (64), 15 states have call predecessors, (64), 17 states have return successors, (64), 19 states have call predecessors, (64), 20 states have call successors, (64) [2023-12-21 14:41:34,693 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 [] [2023-12-21 14:41:38,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:42,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:45,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:46,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:50,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:51,993 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 [] [2023-12-21 14:41:56,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:41:58,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:04,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 14:42:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:42:45,578 INFO L93 Difference]: Finished difference Result 4006 states and 5678 transitions. [2023-12-21 14:42:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2023-12-21 14:42:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 3.8974358974358974) internal successors, (152), 37 states have internal predecessors, (152), 20 states have call successors, (64), 15 states have call predecessors, (64), 17 states have return successors, (64), 19 states have call predecessors, (64), 20 states have call successors, (64) Word has length 273 [2023-12-21 14:42:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:42:45,593 INFO L225 Difference]: With dead ends: 4006 [2023-12-21 14:42:45,593 INFO L226 Difference]: Without dead ends: 3326 [2023-12-21 14:42:45,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26443 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=7742, Invalid=65970, Unknown=0, NotChecked=0, Total=73712 [2023-12-21 14:42:45,604 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 4971 mSDsluCounter, 12362 mSDsCounter, 0 mSdLazyCounter, 30578 mSolverCounterSat, 4396 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5021 SdHoareTripleChecker+Valid, 13285 SdHoareTripleChecker+Invalid, 34979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4396 IncrementalHoareTripleChecker+Valid, 30578 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.3s IncrementalHoareTripleChecker+Time [2023-12-21 14:42:45,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5021 Valid, 13285 Invalid, 34979 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4396 Valid, 30578 Invalid, 5 Unknown, 0 Unchecked, 51.3s Time] [2023-12-21 14:42:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2023-12-21 14:42:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2357. [2023-12-21 14:42:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1464 states have (on average 1.2650273224043715) internal successors, (1852), 1494 states have internal predecessors, (1852), 669 states have call successors, (669), 160 states have call predecessors, (669), 223 states have return successors, (819), 702 states have call predecessors, (819), 669 states have call successors, (819) [2023-12-21 14:42:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3340 transitions. [2023-12-21 14:42:46,080 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3340 transitions. Word has length 273 [2023-12-21 14:42:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:42:46,080 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3340 transitions. [2023-12-21 14:42:46,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 3.8974358974358974) internal successors, (152), 37 states have internal predecessors, (152), 20 states have call successors, (64), 15 states have call predecessors, (64), 17 states have return successors, (64), 19 states have call predecessors, (64), 20 states have call successors, (64) [2023-12-21 14:42:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3340 transitions. [2023-12-21 14:42:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-21 14:42:46,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:42:46,085 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:42:46,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 14:42:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 14:42:46,295 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:42:46,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:42:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 198852567, now seen corresponding path program 1 times [2023-12-21 14:42:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:42:46,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672392197] [2023-12-21 14:42:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:42:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:47,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-21 14:42:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 14:42:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 14:42:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:42:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:42:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-21 14:42:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-21 14:42:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 14:42:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-21 14:42:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-21 14:42:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-21 14:42:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-21 14:42:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 14:42:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-12-21 14:42:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-21 14:42:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 14:42:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:42:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 14:42:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 14:42:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-21 14:42:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-12-21 14:42:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 14:42:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-21 14:42:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 14:42:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 14:42:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-21 14:42:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 14:42:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 14:42:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2023-12-21 14:42:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:42:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672392197] [2023-12-21 14:42:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672392197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 14:42:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664791735] [2023-12-21 14:42:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:42:48,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 14:42:48,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:42:48,413 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 14:42:48,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 14:42:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:42:53,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 164 conjunts are in the unsatisfiable core [2023-12-21 14:42:53,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 14:42:53,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 11 [2023-12-21 14:42:53,452 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 11 treesize of output 7 [2023-12-21 14:42:53,486 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-21 14:42:54,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 14:42:54,499 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 21 treesize of output 17 [2023-12-21 14:42:55,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:42:55,226 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 30 treesize of output 31 [2023-12-21 14:42:55,232 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 22 treesize of output 20 [2023-12-21 14:42:55,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-12-21 14:42:55,445 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-21 14:42:55,446 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 46 treesize of output 48 [2023-12-21 14:42:55,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-21 14:42:55,732 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 55 treesize of output 50 [2023-12-21 14:42:55,777 INFO L349 Elim1Store]: treesize reduction 140, result has 25.1 percent of original size [2023-12-21 14:42:55,777 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 74 treesize of output 100 [2023-12-21 14:43:14,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 14:43:14,843 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 184 treesize of output 184 [2023-12-21 14:43:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-12-21 14:43:15,464 INFO L349 Elim1Store]: treesize reduction 116, result has 23.2 percent of original size [2023-12-21 14:43:15,464 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 56 treesize of output 76 [2023-12-21 14:43:58,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 105 [2023-12-21 14:43:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 14:43:58,360 INFO L349 Elim1Store]: treesize reduction 202, result has 31.5 percent of original size [2023-12-21 14:43:58,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 236 [2023-12-21 14:43:58,506 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 115 treesize of output 97 [2023-12-21 14:43:58,747 INFO L349 Elim1Store]: treesize reduction 254, result has 9.9 percent of original size [2023-12-21 14:43:58,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 101 treesize of output 81 [2023-12-21 14:47:35,970 WARN L293 SmtUtils]: Spent 1.92m on a formula simplification. DAG size of input: 531 DAG size of output: 538 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 14:47:42,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 382 [2023-12-21 14:47:43,326 INFO L349 Elim1Store]: treesize reduction 402, result has 34.4 percent of original size [2023-12-21 14:47:43,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 402 treesize of output 649 [2023-12-21 14:48:23,177 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 78 treesize of output 62 [2023-12-21 14:48:23,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:23,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:23,231 INFO L349 Elim1Store]: treesize reduction 153, result has 12.1 percent of original size [2023-12-21 14:48:23,231 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 62 treesize of output 34 [2023-12-21 14:48:23,318 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 45 [2023-12-21 14:48:23,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:23,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:23,332 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-12-21 14:48:23,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 7 [2023-12-21 14:48:23,348 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 67 treesize of output 53 [2023-12-21 14:48:23,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:23,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:23,367 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2023-12-21 14:48:23,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 7 [2023-12-21 14:48:24,370 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 266 treesize of output 237 [2023-12-21 14:48:24,384 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,388 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,431 INFO L349 Elim1Store]: treesize reduction 289, result has 10.0 percent of original size [2023-12-21 14:48:24,431 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 8 case distinctions, treesize of input 69 treesize of output 45 [2023-12-21 14:48:24,498 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,518 INFO L349 Elim1Store]: treesize reduction 132, result has 7.7 percent of original size [2023-12-21 14:48:24,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 18 [2023-12-21 14:48:24,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,564 INFO L349 Elim1Store]: treesize reduction 164, result has 6.3 percent of original size [2023-12-21 14:48:24,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 18 [2023-12-21 14:48:24,619 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 93 treesize of output 77 [2023-12-21 14:48:24,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,631 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:24,660 INFO L349 Elim1Store]: treesize reduction 173, result has 10.8 percent of original size [2023-12-21 14:48:24,661 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 77 treesize of output 34 [2023-12-21 14:48:25,649 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 93 treesize of output 77 [2023-12-21 14:48:25,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:25,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:25,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:25,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:25,688 INFO L349 Elim1Store]: treesize reduction 145, result has 14.7 percent of original size [2023-12-21 14:48:25,688 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 77 treesize of output 38 [2023-12-21 14:48:27,143 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 82 treesize of output 68 [2023-12-21 14:48:27,149 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,152 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,157 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-12-21 14:48:27,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 7 [2023-12-21 14:48:27,330 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 82 treesize of output 68 [2023-12-21 14:48:27,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,342 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 14:48:27,347 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-12-21 14:48:27,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 7 [2023-12-21 14:48:28,036 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 261 treesize of output 231 [2023-12-21 14:48:31,062 INFO L349 Elim1Store]: treesize reduction 2227, result has 21.3 percent of original size [2023-12-21 14:48:31,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 48 case distinctions, treesize of input 231 treesize of output 922 [2023-12-21 14:50:11,915 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-21 14:50:11,919 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-21 14:50:11,920 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 14:50:11,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 14:50:12,136 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-21 14:50:12,137 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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) 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) ... 77 more [2023-12-21 14:50:12,141 INFO L158 Benchmark]: Toolchain (without parser) took 769499.95ms. Allocated memory was 267.4MB in the beginning and 871.4MB in the end (delta: 604.0MB). Free memory was 215.5MB in the beginning and 621.4MB in the end (delta: -406.0MB). Peak memory consumption was 592.1MB. Max. memory is 8.0GB. [2023-12-21 14:50:12,141 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 14:50:12,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.01ms. Allocated memory is still 267.4MB. Free memory was 215.5MB in the beginning and 181.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-21 14:50:12,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.65ms. Allocated memory is still 267.4MB. Free memory was 181.4MB in the beginning and 175.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 14:50:12,142 INFO L158 Benchmark]: Boogie Preprocessor took 124.17ms. Allocated memory is still 267.4MB. Free memory was 175.6MB in the beginning and 167.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-21 14:50:12,142 INFO L158 Benchmark]: RCFGBuilder took 1681.10ms. Allocated memory is still 267.4MB. Free memory was 167.2MB in the beginning and 168.6MB in the end (delta: -1.4MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2023-12-21 14:50:12,142 INFO L158 Benchmark]: TraceAbstraction took 767076.05ms. Allocated memory was 267.4MB in the beginning and 871.4MB in the end (delta: 604.0MB). Free memory was 168.1MB in the beginning and 621.4MB in the end (delta: -453.3MB). Peak memory consumption was 545.2MB. Max. memory is 8.0GB. [2023-12-21 14:50:12,143 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.53ms. Allocated memory is still 201.3MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.01ms. Allocated memory is still 267.4MB. Free memory was 215.5MB in the beginning and 181.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.65ms. Allocated memory is still 267.4MB. Free memory was 181.4MB in the beginning and 175.6MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 124.17ms. Allocated memory is still 267.4MB. Free memory was 175.6MB in the beginning and 167.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1681.10ms. Allocated memory is still 267.4MB. Free memory was 167.2MB in the beginning and 168.6MB in the end (delta: -1.4MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * TraceAbstraction took 767076.05ms. Allocated memory was 267.4MB in the beginning and 871.4MB in the end (delta: 604.0MB). Free memory was 168.1MB in the beginning and 621.4MB in the end (delta: -453.3MB). Peak memory consumption was 545.2MB. 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...