/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:40:37,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:40:37,936 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-19 15:40:37,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:40:37,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:40:37,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:40:37,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:40:37,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:40:37,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:40:37,975 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:40:37,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:40:37,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:40:37,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:40:37,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:40:37,977 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:40:37,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:40:37,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:40:37,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:40:37,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:40:37,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:40:37,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:40:37,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:40:37,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:40:37,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:40:37,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:40:37,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:40:37,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:40:37,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:40:37,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:40:37,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:40:37,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:40:37,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:40:37,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:40:37,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:40:37,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:40:37,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:40:37,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:40:37,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:40:37,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:40:37,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:40:37,985 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:40:37,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:40:37,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:40:37,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:40:38,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:40:38,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:40:38,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:40:38,247 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:40:38,247 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:40:38,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-19 15:40:39,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:40:39,589 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:40:39,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-19 15:40:39,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f3b465b/a4601b8fc1a74e4dbad6c4a8e16dc22c/FLAGdec2c83a5 [2023-12-19 15:40:39,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f3b465b/a4601b8fc1a74e4dbad6c4a8e16dc22c [2023-12-19 15:40:39,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:40:39,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:40:39,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:40:39,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:40:39,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:40:39,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:39,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5829848e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39, skipping insertion in model container [2023-12-19 15:40:39,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:39,662 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:40:39,811 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-12-19 15:40:39,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:40:39,898 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:40:39,910 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-12-19 15:40:39,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:40:39,972 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:40:39,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39 WrapperNode [2023-12-19 15:40:39,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:40:39,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:40:39,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:40:39,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:40:39,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,046 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2023-12-19 15:40:40,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:40:40,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:40:40,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:40:40,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:40:40,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,119 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 11, 6, 6, 14, 3, 12, 12, 10, 10, 6, 7, 8]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1]. [2023-12-19 15:40:40,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:40:40,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:40:40,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:40:40,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:40:40,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (1/1) ... [2023-12-19 15:40:40,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:40:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:40:40,185 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-19 15:40:40,210 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-19 15:40:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:40:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:40:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:40:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:40:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:40:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-19 15:40:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 15:40:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-19 15:40:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-19 15:40:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-19 15:40:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-19 15:40:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-19 15:40:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-19 15:40:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-19 15:40:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:40:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-19 15:40:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-19 15:40:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:40:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:40:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:40:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:40:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:40:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-19 15:40:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:40:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:40:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:40:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:40:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:40:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:40:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:40:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:40:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 15:40:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-19 15:40:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-19 15:40:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-19 15:40:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-19 15:40:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-19 15:40:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-19 15:40:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:40:40,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:40:40,403 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:40:40,405 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:40:40,866 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:40:40,899 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:40:40,900 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:40:40,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:40:40 BoogieIcfgContainer [2023-12-19 15:40:40,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:40:40,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:40:40,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:40:40,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:40:40,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:40:39" (1/3) ... [2023-12-19 15:40:40,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef2fd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:40:40, skipping insertion in model container [2023-12-19 15:40:40,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:40:39" (2/3) ... [2023-12-19 15:40:40,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef2fd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:40:40, skipping insertion in model container [2023-12-19 15:40:40,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:40:40" (3/3) ... [2023-12-19 15:40:40,908 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-76.i [2023-12-19 15:40:40,923 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:40:40,924 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:40:40,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:40:40,980 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;@18c77773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:40:40,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:40:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 15:40:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:40:40,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:41,000 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:41,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:41,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2023-12-19 15:40:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913668232] [2023-12-19 15:40:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913668232] [2023-12-19 15:40:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913668232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:41,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:41,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:40:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469853589] [2023-12-19 15:40:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:41,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:40:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:40:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:40:41,410 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 15:40:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:41,444 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-19 15:40:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:40:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-19 15:40:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:41,456 INFO L225 Difference]: With dead ends: 183 [2023-12-19 15:40:41,456 INFO L226 Difference]: Without dead ends: 89 [2023-12-19 15:40:41,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:40:41,461 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:41,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-19 15:40:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-19 15:40:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 15:40:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-19 15:40:41,507 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-19 15:40:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:41,507 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-19 15:40:41,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 15:40:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-19 15:40:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:40:41,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:41,510 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:41,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:40:41,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:41,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2023-12-19 15:40:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384293215] [2023-12-19 15:40:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:41,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384293215] [2023-12-19 15:40:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384293215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:41,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:40:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660892511] [2023-12-19 15:40:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:40:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:40:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:40:41,912 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:41,960 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-19 15:40:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:40:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-19 15:40:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:41,967 INFO L225 Difference]: With dead ends: 177 [2023-12-19 15:40:41,968 INFO L226 Difference]: Without dead ends: 89 [2023-12-19 15:40:41,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-19 15:40:41,971 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:41,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-19 15:40:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-19 15:40:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 15:40:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-19 15:40:41,980 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-19 15:40:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:41,986 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-19 15:40:41,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-19 15:40:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 15:40:41,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:41,995 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:41,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:40:41,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:41,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2023-12-19 15:40:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207073208] [2023-12-19 15:40:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207073208] [2023-12-19 15:40:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207073208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:40:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701385634] [2023-12-19 15:40:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:42,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:40:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:40:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:40:42,883 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-19 15:40:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:43,204 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2023-12-19 15:40:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:40:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2023-12-19 15:40:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:43,206 INFO L225 Difference]: With dead ends: 237 [2023-12-19 15:40:43,206 INFO L226 Difference]: Without dead ends: 149 [2023-12-19 15:40:43,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:40:43,208 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 270 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:43,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 624 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:40:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-19 15:40:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2023-12-19 15:40:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 125 states have internal predecessors, (169), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:40:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 207 transitions. [2023-12-19 15:40:43,224 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 207 transitions. Word has length 115 [2023-12-19 15:40:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:43,224 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 207 transitions. [2023-12-19 15:40:43,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-19 15:40:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 207 transitions. [2023-12-19 15:40:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 15:40:43,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:43,226 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:43,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:40:43,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:43,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2023-12-19 15:40:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12507865] [2023-12-19 15:40:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12507865] [2023-12-19 15:40:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12507865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:40:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254356507] [2023-12-19 15:40:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:43,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:40:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:43,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:40:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:40:43,421 INFO L87 Difference]: Start difference. First operand 146 states and 207 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:43,439 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2023-12-19 15:40:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:40:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-19 15:40:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:43,443 INFO L225 Difference]: With dead ends: 246 [2023-12-19 15:40:43,443 INFO L226 Difference]: Without dead ends: 101 [2023-12-19 15:40:43,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-19 15:40:43,452 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 24 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:43,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 216 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-19 15:40:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-19 15:40:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 80 states have internal predecessors, (102), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:40:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2023-12-19 15:40:43,469 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 115 [2023-12-19 15:40:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:43,469 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2023-12-19 15:40:43,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2023-12-19 15:40:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:40:43,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:43,476 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:43,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:40:43,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:43,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2023-12-19 15:40:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453306232] [2023-12-19 15:40:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453306232] [2023-12-19 15:40:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453306232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:43,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538744215] [2023-12-19 15:40:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:43,723 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:43,775 INFO L93 Difference]: Finished difference Result 212 states and 294 transitions. [2023-12-19 15:40:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:40:43,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-19 15:40:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:43,777 INFO L225 Difference]: With dead ends: 212 [2023-12-19 15:40:43,777 INFO L226 Difference]: Without dead ends: 120 [2023-12-19 15:40:43,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:40:43,778 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:43,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 477 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-19 15:40:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-12-19 15:40:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:40:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2023-12-19 15:40:43,803 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 117 [2023-12-19 15:40:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:43,804 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2023-12-19 15:40:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2023-12-19 15:40:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:40:43,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:43,806 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:43,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:40:43,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:43,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2023-12-19 15:40:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411849245] [2023-12-19 15:40:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411849245] [2023-12-19 15:40:44,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411849245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:44,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:44,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:40:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823942342] [2023-12-19 15:40:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:44,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:40:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:40:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:44,074 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:44,156 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2023-12-19 15:40:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:40:44,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-19 15:40:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:44,158 INFO L225 Difference]: With dead ends: 235 [2023-12-19 15:40:44,158 INFO L226 Difference]: Without dead ends: 140 [2023-12-19 15:40:44,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:40:44,159 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:44,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 638 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-19 15:40:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2023-12-19 15:40:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-19 15:40:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2023-12-19 15:40:44,169 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 119 [2023-12-19 15:40:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:44,170 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2023-12-19 15:40:44,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2023-12-19 15:40:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:40:44,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:44,171 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:40:44,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:44,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2023-12-19 15:40:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:44,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782686792] [2023-12-19 15:40:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:44,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:44,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782686792] [2023-12-19 15:40:44,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782686792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:44,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:44,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004831411] [2023-12-19 15:40:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:44,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:44,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:44,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:44,441 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:44,584 INFO L93 Difference]: Finished difference Result 320 states and 437 transitions. [2023-12-19 15:40:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:40:44,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-19 15:40:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:44,586 INFO L225 Difference]: With dead ends: 320 [2023-12-19 15:40:44,586 INFO L226 Difference]: Without dead ends: 224 [2023-12-19 15:40:44,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:44,588 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 152 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:44,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 648 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-19 15:40:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 182. [2023-12-19 15:40:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 145 states have internal predecessors, (182), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 15:40:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 250 transitions. [2023-12-19 15:40:44,603 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 250 transitions. Word has length 121 [2023-12-19 15:40:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:44,605 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 250 transitions. [2023-12-19 15:40:44,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 250 transitions. [2023-12-19 15:40:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:40:44,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:44,607 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:44,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:40:44,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:44,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash 434146884, now seen corresponding path program 1 times [2023-12-19 15:40:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763809502] [2023-12-19 15:40:44,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:44,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763809502] [2023-12-19 15:40:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763809502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:44,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:44,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:40:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164060105] [2023-12-19 15:40:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:44,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:40:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:40:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:40:44,804 INFO L87 Difference]: Start difference. First operand 182 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:44,843 INFO L93 Difference]: Finished difference Result 355 states and 487 transitions. [2023-12-19 15:40:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:40:44,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-19 15:40:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:44,845 INFO L225 Difference]: With dead ends: 355 [2023-12-19 15:40:44,845 INFO L226 Difference]: Without dead ends: 182 [2023-12-19 15:40:44,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:40:44,847 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:44,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 298 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-19 15:40:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-12-19 15:40:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2587412587412588) internal successors, (180), 145 states have internal predecessors, (180), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 15:40:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2023-12-19 15:40:44,864 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 121 [2023-12-19 15:40:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:44,864 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2023-12-19 15:40:44,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2023-12-19 15:40:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:40:44,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:44,866 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:44,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:40:44,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:44,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -980362073, now seen corresponding path program 1 times [2023-12-19 15:40:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85205822] [2023-12-19 15:40:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:45,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:45,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85205822] [2023-12-19 15:40:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85205822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:45,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672583745] [2023-12-19 15:40:45,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:45,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:45,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:45,135 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:45,260 INFO L93 Difference]: Finished difference Result 359 states and 486 transitions. [2023-12-19 15:40:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:40:45,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-19 15:40:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:45,263 INFO L225 Difference]: With dead ends: 359 [2023-12-19 15:40:45,263 INFO L226 Difference]: Without dead ends: 186 [2023-12-19 15:40:45,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:45,265 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 109 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:45,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 526 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-19 15:40:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2023-12-19 15:40:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2517482517482517) internal successors, (179), 145 states have internal predecessors, (179), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 15:40:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2023-12-19 15:40:45,287 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 123 [2023-12-19 15:40:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:45,288 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2023-12-19 15:40:45,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2023-12-19 15:40:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:40:45,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:45,289 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:45,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:40:45,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:45,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1514966570, now seen corresponding path program 1 times [2023-12-19 15:40:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967321335] [2023-12-19 15:40:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-19 15:40:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967321335] [2023-12-19 15:40:46,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967321335] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:40:46,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498163326] [2023-12-19 15:40:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:46,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:40:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:40:46,440 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-19 15:40:46,446 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-19 15:40:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:46,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-19 15:40:46,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:40:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 15:40:47,094 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 223 treesize of output 167 [2023-12-19 15:40:47,099 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 167 treesize of output 143 [2023-12-19 15:40:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-19 15:40:47,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:40:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498163326] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 15:40:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-19 15:40:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 9] total 15 [2023-12-19 15:40:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426751226] [2023-12-19 15:40:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:47,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:40:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:47,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:40:47,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:40:47,455 INFO L87 Difference]: Start difference. First operand 182 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:47,675 INFO L93 Difference]: Finished difference Result 532 states and 719 transitions. [2023-12-19 15:40:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:40:47,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-19 15:40:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:47,677 INFO L225 Difference]: With dead ends: 532 [2023-12-19 15:40:47,677 INFO L226 Difference]: Without dead ends: 359 [2023-12-19 15:40:47,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:40:47,679 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 179 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:47,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 932 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-19 15:40:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 339. [2023-12-19 15:40:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 274 states have (on average 1.2554744525547445) internal successors, (344), 278 states have internal predecessors, (344), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:40:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 456 transitions. [2023-12-19 15:40:47,709 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 456 transitions. Word has length 123 [2023-12-19 15:40:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:47,710 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 456 transitions. [2023-12-19 15:40:47,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 456 transitions. [2023-12-19 15:40:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-19 15:40:47,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:47,711 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:47,728 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-19 15:40:47,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-19 15:40:47,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:47,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash 671553404, now seen corresponding path program 1 times [2023-12-19 15:40:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:47,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636102106] [2023-12-19 15:40:47,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636102106] [2023-12-19 15:40:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636102106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:48,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:48,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88118679] [2023-12-19 15:40:48,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:48,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:48,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:48,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:48,075 INFO L87 Difference]: Start difference. First operand 339 states and 456 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:48,152 INFO L93 Difference]: Finished difference Result 711 states and 951 transitions. [2023-12-19 15:40:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:40:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-12-19 15:40:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:48,157 INFO L225 Difference]: With dead ends: 711 [2023-12-19 15:40:48,157 INFO L226 Difference]: Without dead ends: 381 [2023-12-19 15:40:48,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:48,159 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 72 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:48,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 678 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-19 15:40:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 351. [2023-12-19 15:40:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 283 states have (on average 1.2402826855123674) internal successors, (351), 287 states have internal predecessors, (351), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:40:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 463 transitions. [2023-12-19 15:40:48,189 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 463 transitions. Word has length 124 [2023-12-19 15:40:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:48,189 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 463 transitions. [2023-12-19 15:40:48,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 463 transitions. [2023-12-19 15:40:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 15:40:48,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:48,191 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:48,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:40:48,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:48,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1401893715, now seen corresponding path program 1 times [2023-12-19 15:40:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486237010] [2023-12-19 15:40:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:48,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486237010] [2023-12-19 15:40:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486237010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:40:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520087829] [2023-12-19 15:40:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:48,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:40:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:40:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:40:48,278 INFO L87 Difference]: Start difference. First operand 351 states and 463 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:48,319 INFO L93 Difference]: Finished difference Result 693 states and 918 transitions. [2023-12-19 15:40:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:40:48,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-19 15:40:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:48,323 INFO L225 Difference]: With dead ends: 693 [2023-12-19 15:40:48,323 INFO L226 Difference]: Without dead ends: 355 [2023-12-19 15:40:48,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-19 15:40:48,324 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:48,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-19 15:40:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2023-12-19 15:40:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 287 states have (on average 1.2369337979094077) internal successors, (355), 291 states have internal predecessors, (355), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:40:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2023-12-19 15:40:48,357 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 125 [2023-12-19 15:40:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:48,357 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2023-12-19 15:40:48,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2023-12-19 15:40:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 15:40:48,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:48,359 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:48,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:40:48,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:48,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1204129839, now seen corresponding path program 1 times [2023-12-19 15:40:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:48,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727742467] [2023-12-19 15:40:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727742467] [2023-12-19 15:40:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727742467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:48,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:48,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:40:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772689180] [2023-12-19 15:40:48,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:48,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:40:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:48,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:40:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:40:48,889 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-19 15:40:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:49,213 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2023-12-19 15:40:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:40:49,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 125 [2023-12-19 15:40:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:49,216 INFO L225 Difference]: With dead ends: 700 [2023-12-19 15:40:49,216 INFO L226 Difference]: Without dead ends: 358 [2023-12-19 15:40:49,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:40:49,218 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:49,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 541 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:40:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-19 15:40:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2023-12-19 15:40:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.231578947368421) internal successors, (351), 289 states have internal predecessors, (351), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-19 15:40:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2023-12-19 15:40:49,251 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 125 [2023-12-19 15:40:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:49,252 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2023-12-19 15:40:49,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-19 15:40:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2023-12-19 15:40:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 15:40:49,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:49,253 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:49,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:40:49,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:49,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -772063983, now seen corresponding path program 1 times [2023-12-19 15:40:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890969311] [2023-12-19 15:40:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:49,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890969311] [2023-12-19 15:40:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890969311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:49,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:40:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918362642] [2023-12-19 15:40:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:49,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:40:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:49,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:40:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:40:49,937 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-19 15:40:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:50,342 INFO L93 Difference]: Finished difference Result 530 states and 691 transitions. [2023-12-19 15:40:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:40:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2023-12-19 15:40:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:50,347 INFO L225 Difference]: With dead ends: 530 [2023-12-19 15:40:50,348 INFO L226 Difference]: Without dead ends: 528 [2023-12-19 15:40:50,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:40:50,349 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 211 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:50,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 582 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:40:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-19 15:40:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 394. [2023-12-19 15:40:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 318 states have (on average 1.2169811320754718) internal successors, (387), 322 states have internal predecessors, (387), 63 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-19 15:40:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 513 transitions. [2023-12-19 15:40:50,419 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 513 transitions. Word has length 125 [2023-12-19 15:40:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 513 transitions. [2023-12-19 15:40:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-19 15:40:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 513 transitions. [2023-12-19 15:40:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-19 15:40:50,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:50,421 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:50,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:40:50,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:50,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1452136592, now seen corresponding path program 1 times [2023-12-19 15:40:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422746189] [2023-12-19 15:40:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422746189] [2023-12-19 15:40:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422746189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098595820] [2023-12-19 15:40:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:50,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:50,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:50,584 INFO L87 Difference]: Start difference. First operand 394 states and 513 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:50,682 INFO L93 Difference]: Finished difference Result 756 states and 978 transitions. [2023-12-19 15:40:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:40:50,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-19 15:40:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:50,684 INFO L225 Difference]: With dead ends: 756 [2023-12-19 15:40:50,684 INFO L226 Difference]: Without dead ends: 402 [2023-12-19 15:40:50,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:50,686 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 79 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:50,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 493 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-12-19 15:40:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2023-12-19 15:40:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 314 states have (on average 1.2038216560509554) internal successors, (378), 318 states have internal predecessors, (378), 63 states have call successors, (63), 14 states have call predecessors, (63), 14 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-19 15:40:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2023-12-19 15:40:50,740 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 125 [2023-12-19 15:40:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:50,740 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2023-12-19 15:40:50,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2023-12-19 15:40:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-19 15:40:50,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:50,742 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:50,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:40:50,742 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:50,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1836143434, now seen corresponding path program 1 times [2023-12-19 15:40:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952744326] [2023-12-19 15:40:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:50,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:51,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952744326] [2023-12-19 15:40:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952744326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:51,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:51,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:40:51,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612245223] [2023-12-19 15:40:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:51,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:40:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:40:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:40:51,018 INFO L87 Difference]: Start difference. First operand 392 states and 504 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:51,292 INFO L93 Difference]: Finished difference Result 937 states and 1200 transitions. [2023-12-19 15:40:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:40:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-19 15:40:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:51,296 INFO L225 Difference]: With dead ends: 937 [2023-12-19 15:40:51,296 INFO L226 Difference]: Without dead ends: 585 [2023-12-19 15:40:51,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2023-12-19 15:40:51,298 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 223 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:51,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1251 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-19 15:40:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 555. [2023-12-19 15:40:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 457 states have (on average 1.2056892778993435) internal successors, (551), 463 states have internal predecessors, (551), 77 states have call successors, (77), 20 states have call predecessors, (77), 20 states have return successors, (77), 71 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-19 15:40:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 705 transitions. [2023-12-19 15:40:51,366 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 705 transitions. Word has length 126 [2023-12-19 15:40:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:51,366 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 705 transitions. [2023-12-19 15:40:51,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 705 transitions. [2023-12-19 15:40:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-19 15:40:51,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:51,368 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:51,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:40:51,368 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:51,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 87084600, now seen corresponding path program 1 times [2023-12-19 15:40:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362859238] [2023-12-19 15:40:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362859238] [2023-12-19 15:40:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362859238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443876157] [2023-12-19 15:40:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:51,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:51,541 INFO L87 Difference]: Start difference. First operand 555 states and 705 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:51,732 INFO L93 Difference]: Finished difference Result 1138 states and 1446 transitions. [2023-12-19 15:40:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:40:51,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-19 15:40:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:51,736 INFO L225 Difference]: With dead ends: 1138 [2023-12-19 15:40:51,736 INFO L226 Difference]: Without dead ends: 623 [2023-12-19 15:40:51,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:51,737 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 127 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:51,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 774 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-19 15:40:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 583. [2023-12-19 15:40:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 469 states have (on average 1.1940298507462686) internal successors, (560), 475 states have internal predecessors, (560), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-19 15:40:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 742 transitions. [2023-12-19 15:40:51,815 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 742 transitions. Word has length 126 [2023-12-19 15:40:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:51,815 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 742 transitions. [2023-12-19 15:40:51,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 742 transitions. [2023-12-19 15:40:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 15:40:51,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:51,817 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:51,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:40:51,817 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:51,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash -393966798, now seen corresponding path program 1 times [2023-12-19 15:40:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272703064] [2023-12-19 15:40:51,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-19 15:40:52,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:52,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272703064] [2023-12-19 15:40:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272703064] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:40:52,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605999913] [2023-12-19 15:40:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:52,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:40:52,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:40:52,193 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-19 15:40:52,220 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-19 15:40:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:52,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-19 15:40:52,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:40:52,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 15:40:52,918 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 35 treesize of output 23 [2023-12-19 15:40:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-19 15:40:52,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:40:53,146 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 35 treesize of output 27 [2023-12-19 15:40:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-19 15:40:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605999913] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:40:53,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:40:53,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2023-12-19 15:40:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021888550] [2023-12-19 15:40:53,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:40:53,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-19 15:40:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-19 15:40:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:40:53,186 INFO L87 Difference]: Start difference. First operand 583 states and 742 transitions. Second operand has 19 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) [2023-12-19 15:40:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:53,583 INFO L93 Difference]: Finished difference Result 1168 states and 1465 transitions. [2023-12-19 15:40:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:40:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) Word has length 127 [2023-12-19 15:40:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:53,587 INFO L225 Difference]: With dead ends: 1168 [2023-12-19 15:40:53,587 INFO L226 Difference]: Without dead ends: 625 [2023-12-19 15:40:53,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2023-12-19 15:40:53,589 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 695 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:53,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 481 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:40:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-19 15:40:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 611. [2023-12-19 15:40:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 490 states have (on average 1.1734693877551021) internal successors, (575), 496 states have internal predecessors, (575), 91 states have call successors, (91), 29 states have call predecessors, (91), 29 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-19 15:40:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 757 transitions. [2023-12-19 15:40:53,674 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 757 transitions. Word has length 127 [2023-12-19 15:40:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:53,675 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 757 transitions. [2023-12-19 15:40:53,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) [2023-12-19 15:40:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2023-12-19 15:40:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 15:40:53,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:53,677 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:53,691 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-19 15:40:53,887 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,SelfDestructingSolverStorable17 [2023-12-19 15:40:53,887 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:53,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2082910540, now seen corresponding path program 1 times [2023-12-19 15:40:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496404407] [2023-12-19 15:40:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:54,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496404407] [2023-12-19 15:40:54,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496404407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:54,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:54,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:40:54,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392861804] [2023-12-19 15:40:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:54,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:40:54,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:40:54,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:40:54,329 INFO L87 Difference]: Start difference. First operand 611 states and 757 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-19 15:40:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:54,645 INFO L93 Difference]: Finished difference Result 1133 states and 1400 transitions. [2023-12-19 15:40:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:40:54,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2023-12-19 15:40:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:54,648 INFO L225 Difference]: With dead ends: 1133 [2023-12-19 15:40:54,649 INFO L226 Difference]: Without dead ends: 545 [2023-12-19 15:40:54,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:40:54,650 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 171 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:54,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 382 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:40:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-19 15:40:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2023-12-19 15:40:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 424 states have (on average 1.150943396226415) internal successors, (488), 430 states have internal predecessors, (488), 91 states have call successors, (91), 29 states have call predecessors, (91), 29 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-19 15:40:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 670 transitions. [2023-12-19 15:40:54,726 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 670 transitions. Word has length 127 [2023-12-19 15:40:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:54,727 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 670 transitions. [2023-12-19 15:40:54,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-19 15:40:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 670 transitions. [2023-12-19 15:40:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 15:40:54,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:54,728 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:54,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 15:40:54,729 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:54,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -213349927, now seen corresponding path program 1 times [2023-12-19 15:40:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059186319] [2023-12-19 15:40:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059186319] [2023-12-19 15:40:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059186319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079257653] [2023-12-19 15:40:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:54,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:54,930 INFO L87 Difference]: Start difference. First operand 545 states and 670 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:55,076 INFO L93 Difference]: Finished difference Result 826 states and 1007 transitions. [2023-12-19 15:40:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:40:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-19 15:40:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:55,079 INFO L225 Difference]: With dead ends: 826 [2023-12-19 15:40:55,079 INFO L226 Difference]: Without dead ends: 325 [2023-12-19 15:40:55,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:55,081 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 95 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:55,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 476 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-19 15:40:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 307. [2023-12-19 15:40:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.1265822784810127) internal successors, (267), 240 states have internal predecessors, (267), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-19 15:40:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 371 transitions. [2023-12-19 15:40:55,137 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 371 transitions. Word has length 127 [2023-12-19 15:40:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:55,137 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 371 transitions. [2023-12-19 15:40:55,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 371 transitions. [2023-12-19 15:40:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:40:55,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:55,139 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:55,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:40:55,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:55,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash 383481696, now seen corresponding path program 1 times [2023-12-19 15:40:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613800677] [2023-12-19 15:40:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:55,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613800677] [2023-12-19 15:40:55,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613800677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:55,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:55,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:40:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500459708] [2023-12-19 15:40:55,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:55,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:40:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:55,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:40:55,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:40:55,214 INFO L87 Difference]: Start difference. First operand 307 states and 371 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:55,271 INFO L93 Difference]: Finished difference Result 582 states and 700 transitions. [2023-12-19 15:40:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:40:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-19 15:40:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:55,273 INFO L225 Difference]: With dead ends: 582 [2023-12-19 15:40:55,273 INFO L226 Difference]: Without dead ends: 319 [2023-12-19 15:40:55,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-19 15:40:55,275 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:55,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 196 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:40:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-19 15:40:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 310. [2023-12-19 15:40:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 240 states have (on average 1.125) internal successors, (270), 243 states have internal predecessors, (270), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-19 15:40:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2023-12-19 15:40:55,319 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 128 [2023-12-19 15:40:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:55,319 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2023-12-19 15:40:55,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2023-12-19 15:40:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 15:40:55,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:40:55,321 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 15:40:55,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:40:55,323 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:40:55,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:40:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2136478238, now seen corresponding path program 1 times [2023-12-19 15:40:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:40:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346192869] [2023-12-19 15:40:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:40:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:40:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:40:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:40:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:40:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:40:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:40:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:40:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 15:40:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:40:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:40:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:40:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:40:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:40:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:40:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-19 15:40:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-19 15:40:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:40:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 15:40:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:40:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346192869] [2023-12-19 15:40:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346192869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:40:55,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:40:55,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:40:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330449377] [2023-12-19 15:40:55,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:40:55,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:40:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:40:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:40:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:40:55,512 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:40:55,640 INFO L93 Difference]: Finished difference Result 557 states and 662 transitions. [2023-12-19 15:40:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:40:55,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-19 15:40:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:40:55,641 INFO L225 Difference]: With dead ends: 557 [2023-12-19 15:40:55,641 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 15:40:55,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:40:55,643 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:40:55,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 442 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:40:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 15:40:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 15:40:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 15:40:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 15:40:55,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-12-19 15:40:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:40:55,644 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 15:40:55,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 15:40:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 15:40:55,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 15:40:55,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:40:55,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:40:55,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 15:40:57,456 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 15:40:57,456 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 15:40:57,456 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 15:40:57,456 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 15:40:57,457 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse12 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (* 256 (div .cse16 256))) (.cse14 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse13 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse13 256) 0)) (.cse3 (<= (+ .cse15 .cse14) (+ .cse16 (* 256 (div .cse14 256))))) (.cse11 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse4 (<= .cse14 (+ .cse15 (* 256 (div (+ (* (- 1) .cse16) .cse14) 256)) 255))) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_5_Pointer~0.offset 0)) (.cse7 (= |~#var_1_5~0.offset| 0)) (.cse8 (= .cse13 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (mod (+ (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset) 240) 256)) (.cse10 (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (or (and (= .cse9 .cse10) (<= .cse9 127)) (and (<= 128 .cse9) (= .cse9 (+ 256 .cse10)))))) (and .cse0 .cse1 .cse2 .cse3 .cse11 (<= .cse12 (+ 255 (* 256 (div (+ (- 1) .cse12) 256)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-12-19 15:40:57,457 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-19 15:40:57,457 INFO L895 garLoopResultBuilder]: At program point L118-2(lines 118 124) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse12 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (* 256 (div .cse16 256))) (.cse14 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse13 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse13 256) 0)) (.cse3 (<= (+ .cse15 .cse14) (+ .cse16 (* 256 (div .cse14 256))))) (.cse11 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse4 (<= .cse14 (+ .cse15 (* 256 (div (+ (* (- 1) .cse16) .cse14) 256)) 255))) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_5_Pointer~0.offset 0)) (.cse7 (= |~#var_1_5~0.offset| 0)) (.cse8 (= .cse13 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (mod (+ (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset) 240) 256)) (.cse10 (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (or (and (= .cse9 .cse10) (<= .cse9 127)) (and (<= 128 .cse9) (= .cse9 (+ 256 .cse10)))))) (and .cse0 .cse1 .cse2 .cse3 .cse11 (<= .cse12 (+ 255 (* 256 (div (+ (- 1) .cse12) 256)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-12-19 15:40:57,457 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 15:40:57,457 INFO L899 garLoopResultBuilder]: For program point L118-3(lines 118 124) no Hoare annotation was computed. [2023-12-19 15:40:57,457 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 15:40:57,458 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 15:40:57,458 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,458 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-19 15:40:57,458 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-19 15:40:57,459 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse12 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (* 256 (div .cse16 256))) (.cse14 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse13 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse13 256) 0)) (.cse3 (<= (+ .cse15 .cse14) (+ .cse16 (* 256 (div .cse14 256))))) (.cse11 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse4 (<= .cse14 (+ .cse15 (* 256 (div (+ (* (- 1) .cse16) .cse14) 256)) 255))) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_5_Pointer~0.offset 0)) (.cse7 (= |~#var_1_5~0.offset| 0)) (.cse8 (= .cse13 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (mod (+ (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset) 240) 256)) (.cse10 (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (or (and (= .cse9 .cse10) (<= .cse9 127)) (and (<= 128 .cse9) (= .cse9 (+ 256 .cse10)))))) (and .cse0 .cse1 .cse2 .cse3 .cse11 (<= .cse12 (+ 255 (* 256 (div (+ (- 1) .cse12) 256)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-12-19 15:40:57,459 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-19 15:40:57,459 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,459 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-19 15:40:57,459 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-19 15:40:57,459 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2023-12-19 15:40:57,459 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse11 (* 256 (div .cse12 256))) (.cse10 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse9 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse9 256) 0)) (.cse3 (<= (+ .cse11 .cse10) (+ .cse12 (* 256 (div .cse10 256))))) (.cse5 (<= .cse10 (+ .cse11 (* 256 (div (+ (* (- 1) .cse12) .cse10) 256)) 255))) (.cse6 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_5_Pointer~0.offset 0)) (.cse8 (= |~#var_1_5~0.offset| 0)) (.cse4 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 (+ 255 (* 256 (div (+ (- 1) .cse4) 256)))) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= .cse9 .cse4)))))) [2023-12-19 15:40:57,459 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-19 15:40:57,459 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (= (select (select |#memory_int#12| |~#var_1_13~0.base|) |~#var_1_13~0.offset|) |ULTIMATE.start_updateVariables_#t~mem59#1|) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)) [2023-12-19 15:40:57,460 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-19 15:40:57,460 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse11 (* 256 (div .cse12 256))) (.cse10 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse9 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse9 256) 0)) (.cse3 (<= (+ .cse11 .cse10) (+ .cse12 (* 256 (div .cse10 256))))) (.cse5 (<= .cse10 (+ .cse11 (* 256 (div (+ (* (- 1) .cse12) .cse10) 256)) 255))) (.cse6 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_5_Pointer~0.offset 0)) (.cse8 (= |~#var_1_5~0.offset| 0)) (.cse4 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 (+ 255 (* 256 (div (+ (- 1) .cse4) 256)))) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= .cse9 .cse4)))))) [2023-12-19 15:40:57,460 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-19 15:40:57,460 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 66) no Hoare annotation was computed. [2023-12-19 15:40:57,460 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)) [2023-12-19 15:40:57,460 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-19 15:40:57,460 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 81) no Hoare annotation was computed. [2023-12-19 15:40:57,461 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-19 15:40:57,461 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-19 15:40:57,461 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-19 15:40:57,461 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2023-12-19 15:40:57,461 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 15:40:57,461 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,461 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0)) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-19 15:40:57,462 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L62-2(lines 56 66) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L112-2(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L112-3(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L112-4(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L112-5(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,463 INFO L899 garLoopResultBuilder]: For program point L112-6(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L112-8(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L112-10(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L112-12(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L112-14(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L112-15(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L112-16(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,464 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-17(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-19(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-21(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-23(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-25(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-26(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-27(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-29(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-30(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-31(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-32(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-34(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,466 INFO L899 garLoopResultBuilder]: For program point L112-35(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L112-37(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L112-39(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L112-41(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L112-43(line 112) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 82) no Hoare annotation was computed. [2023-12-19 15:40:57,467 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,467 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-19 15:40:57,468 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-19 15:40:57,468 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-19 15:40:57,468 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-12-19 15:40:57,468 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2023-12-19 15:40:57,468 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2023-12-19 15:40:57,468 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2023-12-19 15:40:57,471 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:40:57,473 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:40:57,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-19 15:40:57,495 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-19 15:40:57,500 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,500 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,500 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,500 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,501 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,501 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,501 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,501 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-19 15:40:57,501 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,501 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,502 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,503 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,504 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,505 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-19 15:40:57,505 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-19 15:40:57,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:40:57 BoogieIcfgContainer [2023-12-19 15:40:57,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:40:57,506 INFO L158 Benchmark]: Toolchain (without parser) took 17886.77ms. Allocated memory was 296.7MB in the beginning and 706.7MB in the end (delta: 410.0MB). Free memory was 241.4MB in the beginning and 440.0MB in the end (delta: -198.6MB). Peak memory consumption was 409.1MB. Max. memory is 8.0GB. [2023-12-19 15:40:57,510 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 190.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:40:57,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.66ms. Allocated memory is still 296.7MB. Free memory was 241.4MB in the beginning and 227.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:40:57,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.33ms. Allocated memory is still 296.7MB. Free memory was 227.3MB in the beginning and 224.1MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 15:40:57,511 INFO L158 Benchmark]: Boogie Preprocessor took 104.93ms. Allocated memory is still 296.7MB. Free memory was 224.1MB in the beginning and 218.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:40:57,511 INFO L158 Benchmark]: RCFGBuilder took 747.45ms. Allocated memory is still 296.7MB. Free memory was 218.9MB in the beginning and 182.2MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-12-19 15:40:57,513 INFO L158 Benchmark]: TraceAbstraction took 16603.57ms. Allocated memory was 296.7MB in the beginning and 706.7MB in the end (delta: 410.0MB). Free memory was 181.6MB in the beginning and 440.0MB in the end (delta: -258.3MB). Peak memory consumption was 349.3MB. Max. memory is 8.0GB. [2023-12-19 15:40:57,516 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.60ms. Allocated memory is still 190.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 351.66ms. Allocated memory is still 296.7MB. Free memory was 241.4MB in the beginning and 227.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.33ms. Allocated memory is still 296.7MB. Free memory was 227.3MB in the beginning and 224.1MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 104.93ms. Allocated memory is still 296.7MB. Free memory was 224.1MB in the beginning and 218.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 747.45ms. Allocated memory is still 296.7MB. Free memory was 218.9MB in the beginning and 182.2MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16603.57ms. Allocated memory was 296.7MB in the beginning and 706.7MB in the end (delta: 410.0MB). Free memory was 181.6MB in the beginning and 440.0MB in the end (delta: -258.3MB). Peak memory consumption was 349.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2995 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2995 mSDsluCounter, 11254 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8085 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2075 IncrementalHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 3169 mSDtfsCounter, 2075 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 1208 SyntacticMatches, 3 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=18, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 410 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 901 PreInvPairs, 953 NumberOfFragments, 2458 HoareAnnotationTreeSize, 901 FormulaSimplifications, 2437 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 17 FormulaSimplificationsInter, 9922 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2945 NumberOfCodeBlocks, 2945 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3169 ConstructedInterpolants, 0 QuantifiedInterpolants, 13668 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1092 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 10588/10920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-19 15:40:57,531 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 0 Received shutdown request...