/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:15:57,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:15:57,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:15:57,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:15:57,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:15:57,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:15:57,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:15:57,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:15:57,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:15:57,693 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:15:57,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:15:57,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:15:57,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:15:57,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:15:57,694 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:15:57,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:15:57,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:15:57,695 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:15:57,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:15:57,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:15:57,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:15:57,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:15:57,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:15:57,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:15:57,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:15:57,697 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:15:57,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:15:57,697 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:15:57,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:15:57,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:15:57,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:15:57,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:15:57,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:15:57,700 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:15:57,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:15:57,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:15:57,700 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:15:57,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:15:57,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:15:57,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:15:57,921 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:15:57,922 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:15:57,923 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-21 02:15:58,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:15:59,008 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:15:59,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-21 02:15:59,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dd34624/f1ee7dea91aa4a93a17d856c2d007f63/FLAGa825117a0 [2023-12-21 02:15:59,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dd34624/f1ee7dea91aa4a93a17d856c2d007f63 [2023-12-21 02:15:59,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:15:59,031 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:15:59,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:15:59,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:15:59,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:15:59,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8fc84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59, skipping insertion in model container [2023-12-21 02:15:59,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,070 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:15:59,183 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-21 02:15:59,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:15:59,247 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:15:59,259 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-21 02:15:59,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:15:59,303 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:15:59,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59 WrapperNode [2023-12-21 02:15:59,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:15:59,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:15:59,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:15:59,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:15:59,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,365 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2023-12-21 02:15:59,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:15:59,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:15:59,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:15:59,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:15:59,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,416 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-21 02:15:59,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:15:59,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:15:59,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:15:59,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:15:59,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (1/1) ... [2023-12-21 02:15:59,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:15:59,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:15:59,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 02:15:59,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 02:15:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:15:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:15:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:15:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 02:15:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 02:15:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 02:15:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 02:15:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 02:15:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:15:59,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-21 02:15:59,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-21 02:15:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-21 02:15:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-21 02:15:59,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-21 02:15:59,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 02:15:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 02:15:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:15:59,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 02:15:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 02:15:59,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 02:15:59,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 02:15:59,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 02:15:59,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-21 02:15:59,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-21 02:15:59,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-21 02:15:59,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-21 02:15:59,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-21 02:15:59,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:15:59,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:15:59,717 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:15:59,719 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:16:00,061 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:16:00,107 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:16:00,108 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:16:00,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:16:00 BoogieIcfgContainer [2023-12-21 02:16:00,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:16:00,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:16:00,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:16:00,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:16:00,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:15:59" (1/3) ... [2023-12-21 02:16:00,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31563cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:16:00, skipping insertion in model container [2023-12-21 02:16:00,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:15:59" (2/3) ... [2023-12-21 02:16:00,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31563cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:16:00, skipping insertion in model container [2023-12-21 02:16:00,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:16:00" (3/3) ... [2023-12-21 02:16:00,114 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-76.i [2023-12-21 02:16:00,125 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:16:00,125 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:16:00,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:16:00,170 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;@39af1f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:16:00,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:16:00,173 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-21 02:16:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:16:00,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:00,185 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-21 02:16:00,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:00,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2023-12-21 02:16:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561563999] [2023-12-21 02:16:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561563999] [2023-12-21 02:16:00,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561563999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:00,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:00,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:16:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127074789] [2023-12-21 02:16:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:00,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:16:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:16:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:16:00,572 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-21 02:16:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:00,613 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-21 02:16:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:16:00,616 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-21 02:16:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:00,622 INFO L225 Difference]: With dead ends: 183 [2023-12-21 02:16:00,623 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 02:16:00,625 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-21 02:16:00,628 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-21 02:16:00,628 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-21 02:16:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 02:16:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-21 02:16:00,664 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-21 02:16:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-21 02:16:00,671 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-21 02:16:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:00,672 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-21 02:16:00,672 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-21 02:16:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-21 02:16:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:16:00,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:00,674 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-21 02:16:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:16:00,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:00,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2023-12-21 02:16:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914713183] [2023-12-21 02:16:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:00,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:01,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:01,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914713183] [2023-12-21 02:16:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914713183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:01,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:01,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:16:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948759322] [2023-12-21 02:16:01,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:01,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:16:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:16:01,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:16:01,031 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-21 02:16:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:01,071 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-21 02:16:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:16:01,071 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-21 02:16:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:01,072 INFO L225 Difference]: With dead ends: 177 [2023-12-21 02:16:01,072 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 02:16:01,073 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-21 02:16:01,074 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-21 02:16:01,074 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-21 02:16:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 02:16:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-21 02:16:01,080 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-21 02:16:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-21 02:16:01,083 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-21 02:16:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:01,084 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-21 02:16:01,084 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-21 02:16:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-21 02:16:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:16:01,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:01,086 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-21 02:16:01,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:16:01,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:01,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2023-12-21 02:16:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:01,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670028961] [2023-12-21 02:16:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670028961] [2023-12-21 02:16:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670028961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:16:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426934606] [2023-12-21 02:16:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:01,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:16:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:16:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:16:01,870 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-21 02:16:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:02,146 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2023-12-21 02:16:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:16:02,147 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-21 02:16:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:02,150 INFO L225 Difference]: With dead ends: 237 [2023-12-21 02:16:02,150 INFO L226 Difference]: Without dead ends: 149 [2023-12-21 02:16:02,153 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-21 02:16:02,155 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 270 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 02:16:02,156 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-21 02:16:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-21 02:16:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2023-12-21 02:16:02,172 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-21 02:16:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 207 transitions. [2023-12-21 02:16:02,173 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 207 transitions. Word has length 115 [2023-12-21 02:16:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:02,174 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 207 transitions. [2023-12-21 02:16:02,174 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-21 02:16:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 207 transitions. [2023-12-21 02:16:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:16:02,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:02,175 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-21 02:16:02,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:16:02,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:02,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2023-12-21 02:16:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452378679] [2023-12-21 02:16:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452378679] [2023-12-21 02:16:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452378679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:16:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080178492] [2023-12-21 02:16:02,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:02,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:16:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:02,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:16:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:16:02,332 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-21 02:16:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:02,348 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2023-12-21 02:16:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:16:02,349 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-21 02:16:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:02,352 INFO L225 Difference]: With dead ends: 246 [2023-12-21 02:16:02,352 INFO L226 Difference]: Without dead ends: 101 [2023-12-21 02:16:02,353 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-21 02:16:02,358 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-21 02:16:02,359 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-21 02:16:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-21 02:16:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-21 02:16:02,375 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-21 02:16:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2023-12-21 02:16:02,376 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 115 [2023-12-21 02:16:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:02,377 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2023-12-21 02:16:02,378 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-21 02:16:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2023-12-21 02:16:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:16:02,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:02,382 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-21 02:16:02,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:16:02,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:02,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2023-12-21 02:16:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901304577] [2023-12-21 02:16:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:02,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901304577] [2023-12-21 02:16:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901304577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:02,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343186457] [2023-12-21 02:16:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:02,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:02,551 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-21 02:16:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:02,592 INFO L93 Difference]: Finished difference Result 212 states and 294 transitions. [2023-12-21 02:16:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:16:02,593 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-21 02:16:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:02,594 INFO L225 Difference]: With dead ends: 212 [2023-12-21 02:16:02,594 INFO L226 Difference]: Without dead ends: 120 [2023-12-21 02:16:02,595 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-21 02:16:02,595 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-21 02:16:02,595 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-21 02:16:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-21 02:16:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-12-21 02:16:02,604 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-21 02:16:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2023-12-21 02:16:02,605 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 117 [2023-12-21 02:16:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:02,606 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2023-12-21 02:16:02,606 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-21 02:16:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2023-12-21 02:16:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:16:02,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:02,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] [2023-12-21 02:16:02,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:16:02,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:02,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2023-12-21 02:16:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:02,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614222158] [2023-12-21 02:16:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:02,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614222158] [2023-12-21 02:16:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614222158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:02,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:02,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:16:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831864237] [2023-12-21 02:16:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:02,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:16:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:16:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:16:02,777 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-21 02:16:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:02,844 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2023-12-21 02:16:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:16:02,845 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-21 02:16:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:02,846 INFO L225 Difference]: With dead ends: 235 [2023-12-21 02:16:02,846 INFO L226 Difference]: Without dead ends: 140 [2023-12-21 02:16:02,846 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-21 02:16:02,847 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-21 02:16:02,847 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-21 02:16:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-21 02:16:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2023-12-21 02:16:02,854 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-21 02:16:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2023-12-21 02:16:02,855 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 119 [2023-12-21 02:16:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:02,855 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2023-12-21 02:16:02,856 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-21 02:16:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2023-12-21 02:16:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-21 02:16:02,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:02,857 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-21 02:16:02,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:16:02,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:02,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2023-12-21 02:16:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:02,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126117226] [2023-12-21 02:16:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126117226] [2023-12-21 02:16:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126117226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656223347] [2023-12-21 02:16:03,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:03,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:03,076 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-21 02:16:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:03,193 INFO L93 Difference]: Finished difference Result 320 states and 437 transitions. [2023-12-21 02:16:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:16:03,193 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-21 02:16:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:03,195 INFO L225 Difference]: With dead ends: 320 [2023-12-21 02:16:03,195 INFO L226 Difference]: Without dead ends: 224 [2023-12-21 02:16:03,195 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-21 02:16:03,196 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-21 02:16:03,196 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-21 02:16:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-21 02:16:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 182. [2023-12-21 02:16:03,211 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-21 02:16:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 250 transitions. [2023-12-21 02:16:03,212 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 250 transitions. Word has length 121 [2023-12-21 02:16:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:03,213 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 250 transitions. [2023-12-21 02:16:03,213 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-21 02:16:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 250 transitions. [2023-12-21 02:16:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-21 02:16:03,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:03,214 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-21 02:16:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:16:03,214 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:03,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 434146884, now seen corresponding path program 1 times [2023-12-21 02:16:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479680287] [2023-12-21 02:16:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479680287] [2023-12-21 02:16:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479680287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:03,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:16:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357143102] [2023-12-21 02:16:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:03,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:16:03,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:03,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:16:03,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:16:03,380 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-21 02:16:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:03,413 INFO L93 Difference]: Finished difference Result 355 states and 487 transitions. [2023-12-21 02:16:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:16:03,413 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-21 02:16:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:03,414 INFO L225 Difference]: With dead ends: 355 [2023-12-21 02:16:03,414 INFO L226 Difference]: Without dead ends: 182 [2023-12-21 02:16:03,415 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-21 02:16:03,416 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-21 02:16:03,416 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-21 02:16:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-21 02:16:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-12-21 02:16:03,428 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-21 02:16:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2023-12-21 02:16:03,428 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 121 [2023-12-21 02:16:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:03,429 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2023-12-21 02:16:03,429 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-21 02:16:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2023-12-21 02:16:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:16:03,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:03,430 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-21 02:16:03,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:16:03,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:03,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash -980362073, now seen corresponding path program 1 times [2023-12-21 02:16:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:03,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652468024] [2023-12-21 02:16:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:03,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:03,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652468024] [2023-12-21 02:16:03,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652468024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:03,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:03,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678211829] [2023-12-21 02:16:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:03,629 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-21 02:16:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:03,734 INFO L93 Difference]: Finished difference Result 359 states and 486 transitions. [2023-12-21 02:16:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:16:03,734 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-21 02:16:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:03,737 INFO L225 Difference]: With dead ends: 359 [2023-12-21 02:16:03,737 INFO L226 Difference]: Without dead ends: 186 [2023-12-21 02:16:03,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-21 02:16:03,739 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-21 02:16:03,739 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-21 02:16:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-21 02:16:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2023-12-21 02:16:03,754 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-21 02:16:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2023-12-21 02:16:03,756 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 123 [2023-12-21 02:16:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:03,756 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2023-12-21 02:16:03,756 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-21 02:16:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2023-12-21 02:16:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:16:03,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:03,757 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-21 02:16:03,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:16:03,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:03,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1514966570, now seen corresponding path program 1 times [2023-12-21 02:16:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781966009] [2023-12-21 02:16:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,657 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-21 02:16:04,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781966009] [2023-12-21 02:16:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781966009] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:16:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108303902] [2023-12-21 02:16:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:04,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:16:04,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:16:04,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:16:04,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 02:16:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:04,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 02:16:04,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:16:04,919 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-21 02:16:05,220 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-21 02:16:05,225 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-21 02:16:05,260 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-21 02:16:05,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:16:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108303902] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:16:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:16:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 9] total 15 [2023-12-21 02:16:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399055511] [2023-12-21 02:16:05,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:05,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:16:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:05,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:16:05,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-12-21 02:16:05,477 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-21 02:16:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:05,646 INFO L93 Difference]: Finished difference Result 532 states and 719 transitions. [2023-12-21 02:16:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:16:05,647 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-21 02:16:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:05,649 INFO L225 Difference]: With dead ends: 532 [2023-12-21 02:16:05,649 INFO L226 Difference]: Without dead ends: 359 [2023-12-21 02:16:05,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-12-21 02:16:05,650 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 179 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 02:16:05,650 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-21 02:16:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-21 02:16:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 339. [2023-12-21 02:16:05,679 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-21 02:16:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 456 transitions. [2023-12-21 02:16:05,680 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 456 transitions. Word has length 123 [2023-12-21 02:16:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:05,681 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 456 transitions. [2023-12-21 02:16:05,681 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-21 02:16:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 456 transitions. [2023-12-21 02:16:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 02:16:05,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:05,682 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-21 02:16:05,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 02:16:05,888 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-21 02:16:05,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:05,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 671553404, now seen corresponding path program 1 times [2023-12-21 02:16:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:05,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765321100] [2023-12-21 02:16:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:05,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:05,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765321100] [2023-12-21 02:16:05,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765321100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:05,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:05,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:05,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348444247] [2023-12-21 02:16:05,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:05,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:06,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:06,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:06,000 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-21 02:16:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:06,085 INFO L93 Difference]: Finished difference Result 711 states and 951 transitions. [2023-12-21 02:16:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:16:06,085 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-21 02:16:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:06,087 INFO L225 Difference]: With dead ends: 711 [2023-12-21 02:16:06,087 INFO L226 Difference]: Without dead ends: 381 [2023-12-21 02:16:06,087 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-21 02:16:06,088 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-21 02:16:06,088 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-21 02:16:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-21 02:16:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 351. [2023-12-21 02:16:06,106 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-21 02:16:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 463 transitions. [2023-12-21 02:16:06,108 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 463 transitions. Word has length 124 [2023-12-21 02:16:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:06,108 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 463 transitions. [2023-12-21 02:16:06,108 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-21 02:16:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 463 transitions. [2023-12-21 02:16:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:16:06,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:06,109 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-21 02:16:06,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:16:06,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:06,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1401893715, now seen corresponding path program 1 times [2023-12-21 02:16:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244128411] [2023-12-21 02:16:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244128411] [2023-12-21 02:16:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244128411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:06,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:16:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012257380] [2023-12-21 02:16:06,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:06,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:16:06,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:06,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:16:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:16:06,173 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-21 02:16:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:06,202 INFO L93 Difference]: Finished difference Result 693 states and 918 transitions. [2023-12-21 02:16:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:16:06,202 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-21 02:16:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:06,205 INFO L225 Difference]: With dead ends: 693 [2023-12-21 02:16:06,205 INFO L226 Difference]: Without dead ends: 355 [2023-12-21 02:16:06,206 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-21 02:16:06,206 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-21 02:16:06,207 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-21 02:16:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-21 02:16:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2023-12-21 02:16:06,227 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-21 02:16:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2023-12-21 02:16:06,228 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 125 [2023-12-21 02:16:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:06,229 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2023-12-21 02:16:06,229 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-21 02:16:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2023-12-21 02:16:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:16:06,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:06,230 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-21 02:16:06,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:16:06,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:06,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1204129839, now seen corresponding path program 1 times [2023-12-21 02:16:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85914311] [2023-12-21 02:16:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:06,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85914311] [2023-12-21 02:16:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85914311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:06,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:06,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:16:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634304414] [2023-12-21 02:16:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:06,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:16:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:16:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:16:06,610 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-21 02:16:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:06,898 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2023-12-21 02:16:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:16:06,899 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-21 02:16:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:06,900 INFO L225 Difference]: With dead ends: 700 [2023-12-21 02:16:06,900 INFO L226 Difference]: Without dead ends: 358 [2023-12-21 02:16:06,901 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-21 02:16:06,902 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-21 02:16:06,902 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-21 02:16:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-21 02:16:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2023-12-21 02:16:06,924 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-21 02:16:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2023-12-21 02:16:06,925 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 125 [2023-12-21 02:16:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:06,925 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2023-12-21 02:16:06,926 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-21 02:16:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2023-12-21 02:16:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:16:06,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:06,926 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-21 02:16:06,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:16:06,927 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:06,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash -772063983, now seen corresponding path program 1 times [2023-12-21 02:16:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19446890] [2023-12-21 02:16:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:07,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19446890] [2023-12-21 02:16:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19446890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:16:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230989354] [2023-12-21 02:16:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:07,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:16:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:16:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:16:07,422 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-21 02:16:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:07,698 INFO L93 Difference]: Finished difference Result 530 states and 691 transitions. [2023-12-21 02:16:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:16:07,698 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-21 02:16:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:07,700 INFO L225 Difference]: With dead ends: 530 [2023-12-21 02:16:07,700 INFO L226 Difference]: Without dead ends: 528 [2023-12-21 02:16:07,701 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-21 02:16:07,701 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 211 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 02:16:07,701 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-21 02:16:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-21 02:16:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 394. [2023-12-21 02:16:07,739 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-21 02:16:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 513 transitions. [2023-12-21 02:16:07,741 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 513 transitions. Word has length 125 [2023-12-21 02:16:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:07,741 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 513 transitions. [2023-12-21 02:16:07,741 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-21 02:16:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 513 transitions. [2023-12-21 02:16:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 02:16:07,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:07,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] [2023-12-21 02:16:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:16:07,742 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:07,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1452136592, now seen corresponding path program 1 times [2023-12-21 02:16:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606915429] [2023-12-21 02:16:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606915429] [2023-12-21 02:16:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606915429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327872587] [2023-12-21 02:16:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:07,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:07,846 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-21 02:16:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:07,924 INFO L93 Difference]: Finished difference Result 756 states and 978 transitions. [2023-12-21 02:16:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:16:07,925 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-21 02:16:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:07,926 INFO L225 Difference]: With dead ends: 756 [2023-12-21 02:16:07,926 INFO L226 Difference]: Without dead ends: 402 [2023-12-21 02:16:07,927 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-21 02:16:07,927 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-21 02:16:07,927 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-21 02:16:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-12-21 02:16:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2023-12-21 02:16:07,967 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-21 02:16:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2023-12-21 02:16:07,968 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 125 [2023-12-21 02:16:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:07,968 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2023-12-21 02:16:07,969 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-21 02:16:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2023-12-21 02:16:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 02:16:07,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:07,969 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-21 02:16:07,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:16:07,970 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:07,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1836143434, now seen corresponding path program 1 times [2023-12-21 02:16:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364707987] [2023-12-21 02:16:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:08,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364707987] [2023-12-21 02:16:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364707987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:16:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097726566] [2023-12-21 02:16:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:08,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:16:08,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:16:08,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:16:08,197 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-21 02:16:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:08,360 INFO L93 Difference]: Finished difference Result 937 states and 1200 transitions. [2023-12-21 02:16:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:16:08,361 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-21 02:16:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:08,363 INFO L225 Difference]: With dead ends: 937 [2023-12-21 02:16:08,363 INFO L226 Difference]: Without dead ends: 585 [2023-12-21 02:16:08,364 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-21 02:16:08,364 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 223 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 02:16:08,364 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-21 02:16:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-21 02:16:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 555. [2023-12-21 02:16:08,412 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-21 02:16:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 705 transitions. [2023-12-21 02:16:08,414 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 705 transitions. Word has length 126 [2023-12-21 02:16:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:08,414 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 705 transitions. [2023-12-21 02:16:08,414 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-21 02:16:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 705 transitions. [2023-12-21 02:16:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-21 02:16:08,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:08,415 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-21 02:16:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:16:08,415 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:08,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 87084600, now seen corresponding path program 1 times [2023-12-21 02:16:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153309810] [2023-12-21 02:16:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153309810] [2023-12-21 02:16:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153309810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561493684] [2023-12-21 02:16:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:08,539 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-21 02:16:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:08,703 INFO L93 Difference]: Finished difference Result 1138 states and 1446 transitions. [2023-12-21 02:16:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:16:08,703 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-21 02:16:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:08,705 INFO L225 Difference]: With dead ends: 1138 [2023-12-21 02:16:08,705 INFO L226 Difference]: Without dead ends: 623 [2023-12-21 02:16:08,706 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-21 02:16:08,706 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-21 02:16:08,706 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-21 02:16:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-21 02:16:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 583. [2023-12-21 02:16:08,754 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-21 02:16:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 742 transitions. [2023-12-21 02:16:08,756 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 742 transitions. Word has length 126 [2023-12-21 02:16:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:08,756 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 742 transitions. [2023-12-21 02:16:08,756 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-21 02:16:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 742 transitions. [2023-12-21 02:16:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-21 02:16:08,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:08,757 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-21 02:16:08,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:16:08,757 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:08,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash -393966798, now seen corresponding path program 1 times [2023-12-21 02:16:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021541080] [2023-12-21 02:16:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:09,003 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-21 02:16:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021541080] [2023-12-21 02:16:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021541080] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:16:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736321064] [2023-12-21 02:16:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:09,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:16:09,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:16:09,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:16:09,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 02:16:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:09,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 02:16:09,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:16:09,337 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-21 02:16:09,637 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-21 02:16:09,642 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-21 02:16:09,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:16:09,845 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-21 02:16:09,877 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-21 02:16:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736321064] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:16:09,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:16:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2023-12-21 02:16:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843832315] [2023-12-21 02:16:09,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:16:09,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 02:16:09,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:09,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 02:16:09,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:16:09,880 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-21 02:16:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:10,217 INFO L93 Difference]: Finished difference Result 1168 states and 1465 transitions. [2023-12-21 02:16:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 02:16:10,218 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-21 02:16:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:10,221 INFO L225 Difference]: With dead ends: 1168 [2023-12-21 02:16:10,221 INFO L226 Difference]: Without dead ends: 625 [2023-12-21 02:16:10,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2023-12-21 02:16:10,222 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 695 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 02:16:10,222 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-21 02:16:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-21 02:16:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 611. [2023-12-21 02:16:10,274 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-21 02:16:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 757 transitions. [2023-12-21 02:16:10,276 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 757 transitions. Word has length 127 [2023-12-21 02:16:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:10,277 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 757 transitions. [2023-12-21 02:16:10,277 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-21 02:16:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2023-12-21 02:16:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-21 02:16:10,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:10,279 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-21 02:16:10,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 02:16:10,488 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-21 02:16:10,488 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:10,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2082910540, now seen corresponding path program 1 times [2023-12-21 02:16:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283303406] [2023-12-21 02:16:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:10,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283303406] [2023-12-21 02:16:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283303406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:16:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812215887] [2023-12-21 02:16:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:10,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:16:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:16:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:16:10,840 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-21 02:16:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:11,100 INFO L93 Difference]: Finished difference Result 1133 states and 1400 transitions. [2023-12-21 02:16:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:16:11,101 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-21 02:16:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:11,103 INFO L225 Difference]: With dead ends: 1133 [2023-12-21 02:16:11,103 INFO L226 Difference]: Without dead ends: 545 [2023-12-21 02:16:11,104 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-21 02:16:11,104 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 171 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 02:16:11,104 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-21 02:16:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-21 02:16:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2023-12-21 02:16:11,153 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-21 02:16:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 670 transitions. [2023-12-21 02:16:11,156 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 670 transitions. Word has length 127 [2023-12-21 02:16:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:11,156 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 670 transitions. [2023-12-21 02:16:11,156 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-21 02:16:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 670 transitions. [2023-12-21 02:16:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-21 02:16:11,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:11,157 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-21 02:16:11,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:16:11,157 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:11,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash -213349927, now seen corresponding path program 1 times [2023-12-21 02:16:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940386176] [2023-12-21 02:16:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:11,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940386176] [2023-12-21 02:16:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940386176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:11,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461038931] [2023-12-21 02:16:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:11,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:11,280 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-21 02:16:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:11,388 INFO L93 Difference]: Finished difference Result 826 states and 1007 transitions. [2023-12-21 02:16:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:16:11,388 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-21 02:16:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:11,390 INFO L225 Difference]: With dead ends: 826 [2023-12-21 02:16:11,390 INFO L226 Difference]: Without dead ends: 325 [2023-12-21 02:16:11,390 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-21 02:16:11,391 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-21 02:16:11,392 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-21 02:16:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-21 02:16:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 307. [2023-12-21 02:16:11,426 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-21 02:16:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 371 transitions. [2023-12-21 02:16:11,427 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 371 transitions. Word has length 127 [2023-12-21 02:16:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:11,427 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 371 transitions. [2023-12-21 02:16:11,427 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-21 02:16:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 371 transitions. [2023-12-21 02:16:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 02:16:11,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:11,428 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-21 02:16:11,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:16:11,429 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:11,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 383481696, now seen corresponding path program 1 times [2023-12-21 02:16:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291706331] [2023-12-21 02:16:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291706331] [2023-12-21 02:16:11,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291706331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:11,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:11,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:16:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684629410] [2023-12-21 02:16:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:11,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:16:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:11,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:16:11,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:16:11,491 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-21 02:16:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:11,556 INFO L93 Difference]: Finished difference Result 582 states and 700 transitions. [2023-12-21 02:16:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:16:11,557 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-21 02:16:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:11,558 INFO L225 Difference]: With dead ends: 582 [2023-12-21 02:16:11,558 INFO L226 Difference]: Without dead ends: 319 [2023-12-21 02:16:11,558 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-21 02:16:11,559 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-21 02:16:11,559 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-21 02:16:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-21 02:16:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 310. [2023-12-21 02:16:11,590 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-21 02:16:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2023-12-21 02:16:11,591 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 128 [2023-12-21 02:16:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:11,591 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2023-12-21 02:16:11,591 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-21 02:16:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2023-12-21 02:16:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-21 02:16:11,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:16:11,592 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-21 02:16:11,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:16:11,592 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:16:11,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:16:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2136478238, now seen corresponding path program 1 times [2023-12-21 02:16:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:16:11,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326843857] [2023-12-21 02:16:11,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:16:11,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:16:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:16:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:16:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:16:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:16:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:16:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:16:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:16:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:16:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:16:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:16:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:16:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:16:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 02:16:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 02:16:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:16:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:16:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 02:16:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:16:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326843857] [2023-12-21 02:16:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326843857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:16:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:16:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:16:11,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249109625] [2023-12-21 02:16:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:16:11,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:16:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:16:11,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:16:11,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:16:11,723 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-21 02:16:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:16:11,815 INFO L93 Difference]: Finished difference Result 557 states and 662 transitions. [2023-12-21 02:16:11,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:16:11,815 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-21 02:16:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:16:11,816 INFO L225 Difference]: With dead ends: 557 [2023-12-21 02:16:11,816 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 02:16:11,817 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-21 02:16:11,817 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 02:16:11,818 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-21 02:16:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 02:16:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 02:16:11,818 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-21 02:16:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 02:16:11,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-12-21 02:16:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:16:11,818 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 02:16:11,818 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-21 02:16:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 02:16:11,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 02:16:11,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:16:11,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 02:16:11,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 02:16:13,412 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-21 02:16:13,412 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-21 02:16:13,412 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-21 02:16:13,412 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-21 02:16:13,413 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-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-21 02:16:13,413 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-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L118-3(lines 118 124) no Hoare annotation was computed. [2023-12-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-21 02:16:13,413 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-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-21 02:16:13,413 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-21 02:16:13,414 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-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-21 02:16:13,414 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-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2023-12-21 02:16:13,414 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-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-21 02:16:13,414 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-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-21 02:16:13,414 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-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 66) no Hoare annotation was computed. [2023-12-21 02:16:13,414 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-21 02:16:13,414 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 81) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 02:16:13,415 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-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-21 02:16:13,415 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-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-21 02:16:13,415 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-21 02:16:13,416 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-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L62-2(lines 56 66) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-2(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-3(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-4(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-5(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-6(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-8(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-10(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-12(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-14(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-15(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,416 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-21 02:16:13,416 INFO L899 garLoopResultBuilder]: For program point L112-16(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-17(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-19(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-21(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-23(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-25(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-26(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-27(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-29(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-30(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-31(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-32(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-34(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-35(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-37(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-39(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-41(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L112-43(line 112) no Hoare annotation was computed. [2023-12-21 02:16:13,417 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-21 02:16:13,417 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 82) no Hoare annotation was computed. [2023-12-21 02:16:13,418 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-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-21 02:16:13,418 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-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-12-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2023-12-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2023-12-21 02:16:13,418 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2023-12-21 02:16:13,420 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-21 02:16:13,421 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:16:13,435 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-21 02:16:13,437 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-21 02:16:13,437 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,438 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,439 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,440 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-21 02:16:13,441 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-21 02:16:13,441 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-21 02:16:13,441 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-21 02:16:13,441 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-21 02:16:13,441 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-21 02:16:13,441 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-21 02:16:13,441 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-21 02:16:13,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:16:13 BoogieIcfgContainer [2023-12-21 02:16:13,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:16:13,442 INFO L158 Benchmark]: Toolchain (without parser) took 14411.08ms. Allocated memory was 197.1MB in the beginning and 595.6MB in the end (delta: 398.5MB). Free memory was 145.4MB in the beginning and 471.8MB in the end (delta: -326.4MB). Peak memory consumption was 336.6MB. Max. memory is 8.0GB. [2023-12-21 02:16:13,445 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:16:13,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.63ms. Allocated memory is still 197.1MB. Free memory was 145.2MB in the beginning and 131.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:16:13,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.01ms. Allocated memory is still 197.1MB. Free memory was 131.3MB in the beginning and 128.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:16:13,446 INFO L158 Benchmark]: Boogie Preprocessor took 78.31ms. Allocated memory is still 197.1MB. Free memory was 127.9MB in the beginning and 122.9MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:16:13,448 INFO L158 Benchmark]: RCFGBuilder took 662.71ms. Allocated memory was 197.1MB in the beginning and 338.7MB in the end (delta: 141.6MB). Free memory was 122.9MB in the beginning and 279.8MB in the end (delta: -156.9MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2023-12-21 02:16:13,448 INFO L158 Benchmark]: TraceAbstraction took 13332.23ms. Allocated memory was 338.7MB in the beginning and 595.6MB in the end (delta: 256.9MB). Free memory was 279.3MB in the beginning and 471.8MB in the end (delta: -192.5MB). Peak memory consumption was 327.6MB. Max. memory is 8.0GB. [2023-12-21 02:16:13,450 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.11ms. Allocated memory is still 197.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.63ms. Allocated memory is still 197.1MB. Free memory was 145.2MB in the beginning and 131.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.01ms. Allocated memory is still 197.1MB. Free memory was 131.3MB in the beginning and 128.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.31ms. Allocated memory is still 197.1MB. Free memory was 127.9MB in the beginning and 122.9MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 662.71ms. Allocated memory was 197.1MB in the beginning and 338.7MB in the end (delta: 141.6MB). Free memory was 122.9MB in the beginning and 279.8MB in the end (delta: -156.9MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * TraceAbstraction took 13332.23ms. Allocated memory was 338.7MB in the beginning and 595.6MB in the end (delta: 256.9MB). Free memory was 279.3MB in the beginning and 471.8MB in the end (delta: -192.5MB). Peak memory consumption was 327.6MB. 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: 13.3s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2995 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2995 mSDsluCounter, 11254 SdHoareTripleChecker+Invalid, 1.3s 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.0s 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.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 410 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 901 PreInvPairs, 953 NumberOfFragments, 2458 HoareAnnotationTreeSize, 901 FormulaSimplifications, 2437 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FormulaSimplificationsInter, 9922 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s 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-21 02:16:13,481 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...