/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-54.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:12:37,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:12:37,991 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:12:37,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:12:37,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:12:38,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:12:38,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:12:38,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:12:38,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:12:38,013 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:12:38,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:12:38,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:12:38,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:12:38,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:12:38,015 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:12:38,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:12:38,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:12:38,016 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:12:38,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:12:38,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:12:38,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:12:38,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:12:38,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:12:38,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:12:38,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:12:38,026 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:12:38,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:12:38,027 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:12:38,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:12:38,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:12:38,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:12:38,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:12:38,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:12:38,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:12:38,029 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:12:38,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:12:38,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:12:38,030 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:12:38,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:12:38,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:12:38,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:12:38,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:12:38,239 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:12:38,239 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-54.i [2023-12-21 02:12:39,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:12:39,378 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:12:39,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-54.i [2023-12-21 02:12:39,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5fbbe5b/d071f84bcfbd4936bf29be01f8bafd66/FLAGa8983df4c [2023-12-21 02:12:39,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5fbbe5b/d071f84bcfbd4936bf29be01f8bafd66 [2023-12-21 02:12:39,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:12:39,404 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:12:39,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:12:39,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:12:39,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:12:39,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3ebc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39, skipping insertion in model container [2023-12-21 02:12:39,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,432 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:12:39,526 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-54.i[916,929] [2023-12-21 02:12:39,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:12:39,567 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:12:39,575 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-54.i[916,929] [2023-12-21 02:12:39,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:12:39,605 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:12:39,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39 WrapperNode [2023-12-21 02:12:39,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:12:39,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:12:39,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:12:39,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:12:39,610 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:12:39" (1/1) ... [2023-12-21 02:12:39,628 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:12:39" (1/1) ... [2023-12-21 02:12:39,652 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2023-12-21 02:12:39,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:12:39,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:12:39,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:12:39,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:12:39,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,700 INFO L175 MemorySlicer]: Split 115 memory accesses to 13 slices as follows [2, 9, 10, 9, 6, 10, 8, 13, 18, 10, 7, 7, 6]. 16 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 16 writes are split as follows [0, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2023-12-21 02:12:39,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:12:39,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:12:39,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:12:39,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:12:39,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (1/1) ... [2023-12-21 02:12:39,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:12:39,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:12:39,770 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:12:39,788 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:12:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:12:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:12:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:12:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 02:12:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 02:12:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 02:12:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 02:12:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:12:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-21 02:12:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-21 02:12:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-21 02:12:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-21 02:12:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-21 02:12:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:12:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 02:12:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:12:39,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 02:12:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-21 02:12:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:12:39,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:12:39,951 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:12:39,953 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:12:40,297 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:12:40,320 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:12:40,320 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:12:40,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:12:40 BoogieIcfgContainer [2023-12-21 02:12:40,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:12:40,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:12:40,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:12:40,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:12:40,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:12:39" (1/3) ... [2023-12-21 02:12:40,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d4c1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:12:40, skipping insertion in model container [2023-12-21 02:12:40,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:12:39" (2/3) ... [2023-12-21 02:12:40,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d4c1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:12:40, skipping insertion in model container [2023-12-21 02:12:40,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:12:40" (3/3) ... [2023-12-21 02:12:40,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-54.i [2023-12-21 02:12:40,338 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:12:40,338 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:12:40,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:12:40,376 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;@1e08fccb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:12:40,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:12:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:12:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 02:12:40,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:40,403 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:40,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:40,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash -165226467, now seen corresponding path program 1 times [2023-12-21 02:12:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:40,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828205616] [2023-12-21 02:12:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828205616] [2023-12-21 02:12:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828205616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:12:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178270120] [2023-12-21 02:12:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:12:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:12:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:12:40,781 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:12:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:40,830 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2023-12-21 02:12:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:12:40,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2023-12-21 02:12:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:40,842 INFO L225 Difference]: With dead ends: 203 [2023-12-21 02:12:40,843 INFO L226 Difference]: Without dead ends: 101 [2023-12-21 02:12:40,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:12:40,848 INFO L413 NwaCegarLoop]: 146 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, 146 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:12:40,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-21 02:12:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-21 02:12:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:12:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2023-12-21 02:12:40,886 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2023-12-21 02:12:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:40,887 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2023-12-21 02:12:40,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:12:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2023-12-21 02:12:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 02:12:40,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:40,891 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:40,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:12:40,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:40,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 425522889, now seen corresponding path program 1 times [2023-12-21 02:12:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602729882] [2023-12-21 02:12:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602729882] [2023-12-21 02:12:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602729882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:12:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665973329] [2023-12-21 02:12:41,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:41,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:12:41,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:12:41,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:12:41,205 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:41,276 INFO L93 Difference]: Finished difference Result 232 states and 346 transitions. [2023-12-21 02:12:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:12:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2023-12-21 02:12:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:41,279 INFO L225 Difference]: With dead ends: 232 [2023-12-21 02:12:41,279 INFO L226 Difference]: Without dead ends: 132 [2023-12-21 02:12:41,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:41,280 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 76 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:41,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-21 02:12:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2023-12-21 02:12:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:12:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2023-12-21 02:12:41,288 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2023-12-21 02:12:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:41,289 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2023-12-21 02:12:41,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2023-12-21 02:12:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-21 02:12:41,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:41,291 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:41,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:12:41,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:41,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1449995118, now seen corresponding path program 1 times [2023-12-21 02:12:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797436978] [2023-12-21 02:12:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797436978] [2023-12-21 02:12:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797436978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:12:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026105946] [2023-12-21 02:12:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:12:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:12:41,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:12:41,469 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:41,505 INFO L93 Difference]: Finished difference Result 213 states and 314 transitions. [2023-12-21 02:12:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:12:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2023-12-21 02:12:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:41,508 INFO L225 Difference]: With dead ends: 213 [2023-12-21 02:12:41,508 INFO L226 Difference]: Without dead ends: 111 [2023-12-21 02:12:41,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:41,513 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 12 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:41,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 426 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-21 02:12:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2023-12-21 02:12:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:12:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2023-12-21 02:12:41,525 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 102 [2023-12-21 02:12:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:41,525 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2023-12-21 02:12:41,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2023-12-21 02:12:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-21 02:12:41,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:41,526 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:41,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:12:41,527 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:41,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1507253420, now seen corresponding path program 1 times [2023-12-21 02:12:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395273142] [2023-12-21 02:12:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395273142] [2023-12-21 02:12:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395273142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:12:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016306126] [2023-12-21 02:12:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:12:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:12:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:12:41,648 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:41,688 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2023-12-21 02:12:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:12:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2023-12-21 02:12:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:41,691 INFO L225 Difference]: With dead ends: 213 [2023-12-21 02:12:41,691 INFO L226 Difference]: Without dead ends: 109 [2023-12-21 02:12:41,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:41,696 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:41,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 427 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-21 02:12:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-12-21 02:12:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:12:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2023-12-21 02:12:41,703 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2023-12-21 02:12:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:41,703 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2023-12-21 02:12:41,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2023-12-21 02:12:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-21 02:12:41,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:41,704 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:12:41,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:41,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1507313002, now seen corresponding path program 1 times [2023-12-21 02:12:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288826704] [2023-12-21 02:12:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288826704] [2023-12-21 02:12:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288826704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:41,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:12:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28571684] [2023-12-21 02:12:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:41,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:12:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:12:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:41,920 INFO L87 Difference]: Start difference. First operand 107 states and 156 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:42,006 INFO L93 Difference]: Finished difference Result 345 states and 503 transitions. [2023-12-21 02:12:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:12:42,007 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2023-12-21 02:12:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:42,009 INFO L225 Difference]: With dead ends: 345 [2023-12-21 02:12:42,009 INFO L226 Difference]: Without dead ends: 239 [2023-12-21 02:12:42,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:12:42,010 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 223 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:42,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 559 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:12:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-21 02:12:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 128. [2023-12-21 02:12:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:12:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 189 transitions. [2023-12-21 02:12:42,024 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 189 transitions. Word has length 102 [2023-12-21 02:12:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:42,024 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 189 transitions. [2023-12-21 02:12:42,024 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 189 transitions. [2023-12-21 02:12:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-21 02:12:42,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:42,026 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:12:42,026 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:42,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1825202413, now seen corresponding path program 1 times [2023-12-21 02:12:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:42,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118144646] [2023-12-21 02:12:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:42,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:42,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118144646] [2023-12-21 02:12:42,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118144646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:42,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:42,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:12:42,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144615238] [2023-12-21 02:12:42,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:42,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:12:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:12:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:12:42,242 INFO L87 Difference]: Start difference. First operand 128 states and 189 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:42,280 INFO L93 Difference]: Finished difference Result 357 states and 525 transitions. [2023-12-21 02:12:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:12:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-21 02:12:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:42,282 INFO L225 Difference]: With dead ends: 357 [2023-12-21 02:12:42,282 INFO L226 Difference]: Without dead ends: 230 [2023-12-21 02:12:42,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:42,283 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 109 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:42,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 417 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-21 02:12:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2023-12-21 02:12:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.4271356783919598) internal successors, (284), 199 states have internal predecessors, (284), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:12:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2023-12-21 02:12:42,298 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 103 [2023-12-21 02:12:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:42,299 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2023-12-21 02:12:42,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2023-12-21 02:12:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-21 02:12:42,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:42,301 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:42,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:12:42,302 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:42,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash 780821141, now seen corresponding path program 1 times [2023-12-21 02:12:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950920057] [2023-12-21 02:12:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950920057] [2023-12-21 02:12:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950920057] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:12:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699533697] [2023-12-21 02:12:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:12:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:12:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:42,526 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:42,597 INFO L93 Difference]: Finished difference Result 455 states and 667 transitions. [2023-12-21 02:12:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:12:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-21 02:12:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:42,599 INFO L225 Difference]: With dead ends: 455 [2023-12-21 02:12:42,599 INFO L226 Difference]: Without dead ends: 230 [2023-12-21 02:12:42,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:12:42,600 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 143 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:42,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 530 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-21 02:12:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2023-12-21 02:12:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 199 states have internal predecessors, (283), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 02:12:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2023-12-21 02:12:42,612 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 103 [2023-12-21 02:12:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:42,612 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2023-12-21 02:12:42,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2023-12-21 02:12:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-21 02:12:42,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:42,613 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:42,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:12:42,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:42,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1038986579, now seen corresponding path program 1 times [2023-12-21 02:12:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:42,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807645925] [2023-12-21 02:12:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:43,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807645925] [2023-12-21 02:12:43,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807645925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:43,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:43,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:12:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894003722] [2023-12-21 02:12:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:43,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:12:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:43,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:12:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:12:43,248 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:12:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:43,592 INFO L93 Difference]: Finished difference Result 615 states and 886 transitions. [2023-12-21 02:12:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:12:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2023-12-21 02:12:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:43,594 INFO L225 Difference]: With dead ends: 615 [2023-12-21 02:12:43,594 INFO L226 Difference]: Without dead ends: 390 [2023-12-21 02:12:43,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-12-21 02:12:43,596 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 438 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:43,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 729 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:12:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-21 02:12:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 348. [2023-12-21 02:12:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 307 states have (on average 1.3843648208469055) internal successors, (425), 309 states have internal predecessors, (425), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-21 02:12:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 497 transitions. [2023-12-21 02:12:43,615 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 497 transitions. Word has length 103 [2023-12-21 02:12:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:43,615 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 497 transitions. [2023-12-21 02:12:43,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:12:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 497 transitions. [2023-12-21 02:12:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 02:12:43,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:43,616 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:12:43,616 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:43,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2092344975, now seen corresponding path program 1 times [2023-12-21 02:12:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467021850] [2023-12-21 02:12:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467021850] [2023-12-21 02:12:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467021850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:12:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855855661] [2023-12-21 02:12:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:43,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:12:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:12:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:43,815 INFO L87 Difference]: Start difference. First operand 348 states and 497 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:43,877 INFO L93 Difference]: Finished difference Result 797 states and 1142 transitions. [2023-12-21 02:12:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:12:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-21 02:12:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:43,880 INFO L225 Difference]: With dead ends: 797 [2023-12-21 02:12:43,881 INFO L226 Difference]: Without dead ends: 606 [2023-12-21 02:12:43,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:12:43,882 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 205 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:43,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 847 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-12-21 02:12:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 374. [2023-12-21 02:12:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 333 states have (on average 1.3963963963963963) internal successors, (465), 335 states have internal predecessors, (465), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-21 02:12:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 537 transitions. [2023-12-21 02:12:43,900 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 537 transitions. Word has length 104 [2023-12-21 02:12:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:43,901 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 537 transitions. [2023-12-21 02:12:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 537 transitions. [2023-12-21 02:12:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 02:12:43,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:43,902 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:43,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:12:43,902 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:43,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1615816307, now seen corresponding path program 1 times [2023-12-21 02:12:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569637669] [2023-12-21 02:12:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569637669] [2023-12-21 02:12:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569637669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:44,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:44,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:12:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890158354] [2023-12-21 02:12:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:44,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:12:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:12:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:12:44,245 INFO L87 Difference]: Start difference. First operand 374 states and 537 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:44,438 INFO L93 Difference]: Finished difference Result 896 states and 1287 transitions. [2023-12-21 02:12:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:12:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-21 02:12:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:44,441 INFO L225 Difference]: With dead ends: 896 [2023-12-21 02:12:44,441 INFO L226 Difference]: Without dead ends: 679 [2023-12-21 02:12:44,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-12-21 02:12:44,442 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 310 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:44,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 2108 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:12:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2023-12-21 02:12:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 532. [2023-12-21 02:12:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 471 states have (on average 1.384288747346072) internal successors, (652), 474 states have internal predecessors, (652), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 02:12:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 760 transitions. [2023-12-21 02:12:44,471 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 760 transitions. Word has length 104 [2023-12-21 02:12:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:44,471 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 760 transitions. [2023-12-21 02:12:44,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 760 transitions. [2023-12-21 02:12:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 02:12:44,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:44,473 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:44,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:12:44,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:44,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -286906641, now seen corresponding path program 1 times [2023-12-21 02:12:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648789734] [2023-12-21 02:12:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648789734] [2023-12-21 02:12:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648789734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:12:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539974647] [2023-12-21 02:12:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:45,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:12:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:12:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:12:45,044 INFO L87 Difference]: Start difference. First operand 532 states and 760 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:45,396 INFO L93 Difference]: Finished difference Result 1205 states and 1720 transitions. [2023-12-21 02:12:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 02:12:45,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-21 02:12:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:45,407 INFO L225 Difference]: With dead ends: 1205 [2023-12-21 02:12:45,408 INFO L226 Difference]: Without dead ends: 830 [2023-12-21 02:12:45,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:12:45,409 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 320 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:45,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 2066 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:12:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-12-21 02:12:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 534. [2023-12-21 02:12:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 473 states have (on average 1.3805496828752644) internal successors, (653), 476 states have internal predecessors, (653), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 02:12:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 761 transitions. [2023-12-21 02:12:45,435 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 761 transitions. Word has length 104 [2023-12-21 02:12:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:45,435 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 761 transitions. [2023-12-21 02:12:45,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 761 transitions. [2023-12-21 02:12:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 02:12:45,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:45,436 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:45,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:12:45,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:45,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -873712655, now seen corresponding path program 1 times [2023-12-21 02:12:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919096073] [2023-12-21 02:12:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:45,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919096073] [2023-12-21 02:12:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919096073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:45,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:12:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752365696] [2023-12-21 02:12:45,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:45,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:12:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:12:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:45,564 INFO L87 Difference]: Start difference. First operand 534 states and 761 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:45,625 INFO L93 Difference]: Finished difference Result 1059 states and 1508 transitions. [2023-12-21 02:12:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:12:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-21 02:12:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:45,627 INFO L225 Difference]: With dead ends: 1059 [2023-12-21 02:12:45,627 INFO L226 Difference]: Without dead ends: 682 [2023-12-21 02:12:45,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:12:45,629 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:45,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 880 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2023-12-21 02:12:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 528. [2023-12-21 02:12:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 467 states have (on average 1.3768736616702355) internal successors, (643), 470 states have internal predecessors, (643), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 02:12:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 751 transitions. [2023-12-21 02:12:45,656 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 751 transitions. Word has length 104 [2023-12-21 02:12:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:45,657 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 751 transitions. [2023-12-21 02:12:45,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 751 transitions. [2023-12-21 02:12:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-21 02:12:45,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:45,658 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:45,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:12:45,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:45,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -678715199, now seen corresponding path program 1 times [2023-12-21 02:12:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521328203] [2023-12-21 02:12:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:12:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:12:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:12:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:12:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:12:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:12:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:12:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:12:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:12:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:12:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:12:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:12:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:12:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:12:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:12:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521328203] [2023-12-21 02:12:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521328203] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:12:45,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:12:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:12:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505412176] [2023-12-21 02:12:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:12:45,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:12:45,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:12:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:12:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:12:45,861 INFO L87 Difference]: Start difference. First operand 528 states and 751 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:12:45,916 INFO L93 Difference]: Finished difference Result 589 states and 829 transitions. [2023-12-21 02:12:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:12:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-12-21 02:12:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:12:45,919 INFO L225 Difference]: With dead ends: 589 [2023-12-21 02:12:45,919 INFO L226 Difference]: Without dead ends: 587 [2023-12-21 02:12:45,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:12:45,919 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 123 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:12:45,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 612 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:12:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-12-21 02:12:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 586. [2023-12-21 02:12:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 511 states have (on average 1.356164383561644) internal successors, (693), 515 states have internal predecessors, (693), 64 states have call successors, (64), 10 states have call predecessors, (64), 10 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-21 02:12:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 821 transitions. [2023-12-21 02:12:45,946 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 821 transitions. Word has length 105 [2023-12-21 02:12:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:12:45,946 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 821 transitions. [2023-12-21 02:12:45,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:12:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 821 transitions. [2023-12-21 02:12:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-21 02:12:45,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:12:45,947 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:45,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:12:45,947 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:12:45,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:12:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -678655617, now seen corresponding path program 1 times [2023-12-21 02:12:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:12:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279037857] [2023-12-21 02:12:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:12:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:12:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:12:45,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:12:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:12:46,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:12:46,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:12:46,052 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:12:46,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:12:46,055 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:12:46,058 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:12:46,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:12:46 BoogieIcfgContainer [2023-12-21 02:12:46,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:12:46,167 INFO L158 Benchmark]: Toolchain (without parser) took 6762.86ms. Allocated memory was 240.1MB in the beginning and 428.9MB in the end (delta: 188.7MB). Free memory was 197.6MB in the beginning and 233.8MB in the end (delta: -36.2MB). Peak memory consumption was 153.6MB. Max. memory is 8.0GB. [2023-12-21 02:12:46,167 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 240.1MB. Free memory is still 187.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:12:46,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.38ms. Allocated memory is still 240.1MB. Free memory was 197.3MB in the beginning and 183.0MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 02:12:46,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.95ms. Allocated memory is still 240.1MB. Free memory was 183.0MB in the beginning and 179.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:12:46,168 INFO L158 Benchmark]: Boogie Preprocessor took 81.04ms. Allocated memory is still 240.1MB. Free memory was 179.5MB in the beginning and 174.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:12:46,169 INFO L158 Benchmark]: RCFGBuilder took 585.75ms. Allocated memory was 240.1MB in the beginning and 336.6MB in the end (delta: 96.5MB). Free memory was 174.3MB in the beginning and 287.1MB in the end (delta: -112.9MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2023-12-21 02:12:46,169 INFO L158 Benchmark]: TraceAbstraction took 5844.35ms. Allocated memory was 336.6MB in the beginning and 428.9MB in the end (delta: 92.3MB). Free memory was 286.6MB in the beginning and 233.8MB in the end (delta: 52.8MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. [2023-12-21 02:12:46,170 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.10ms. Allocated memory is still 240.1MB. Free memory is still 187.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.38ms. Allocated memory is still 240.1MB. Free memory was 197.3MB in the beginning and 183.0MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.95ms. Allocated memory is still 240.1MB. Free memory was 183.0MB in the beginning and 179.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.04ms. Allocated memory is still 240.1MB. Free memory was 179.5MB in the beginning and 174.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 585.75ms. Allocated memory was 240.1MB in the beginning and 336.6MB in the end (delta: 96.5MB). Free memory was 174.3MB in the beginning and 287.1MB in the end (delta: -112.9MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5844.35ms. Allocated memory was 336.6MB in the beginning and 428.9MB in the end (delta: 92.3MB). Free memory was 286.6MB in the beginning and 233.8MB in the end (delta: 52.8MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L22] unsigned char var_1_1 = 16; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 10; [L24] unsigned char var_1_3 = 10; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_4 = 0; [L26] unsigned char var_1_4 = 0; [L27] unsigned char* var_1_4_Pointer = &(var_1_4); [L28] unsigned char var_1_6 = 1; [L28] unsigned char var_1_6 = 1; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_9 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] unsigned char var_1_10 = 0; [L32] unsigned char var_1_10 = 0; [L33] unsigned char* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 9.75; [L34] double var_1_11 = 9.75; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] double var_1_12 = 5.5; [L36] double var_1_12 = 5.5; [L37] double* var_1_12_Pointer = &(var_1_12); [L38] double var_1_13 = 4.1; [L38] double var_1_13 = 4.1; [L39] double* var_1_13_Pointer = &(var_1_13); [L40] float var_1_14 = 9.8; [L40] float var_1_14 = 9.8; [L41] float* var_1_14_Pointer = &(var_1_14); [L42] signed char var_1_15 = 25; [L42] signed char var_1_15 = 25; [L43] signed char* var_1_15_Pointer = &(var_1_15); [L44] signed char var_1_16 = 2; [L44] signed char var_1_16 = 2; [L45] signed char* var_1_16_Pointer = &(var_1_16); [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L81] var_1_3 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] var_1_6 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_9 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] var_1_10 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] var_1_12 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_12) [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L94] EXPR \read(var_1_12) [L94] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] var_1_13 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_13) [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L96] EXPR \read(var_1_13) [L96] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] var_1_16 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L112] RET updateVariables() [L113] CALL step() [L49] EXPR \read(*var_1_12_Pointer) [L49] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L50] EXPR \read(*var_1_16_Pointer) [L50] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L51] signed long int stepLocal_0 = -4; [L52] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L52] COND FALSE !(stepLocal_0 >= (*(var_1_15_Pointer))) [L55] EXPR \read(*var_1_3_Pointer) [L55] unsigned char stepLocal_2 = (*(var_1_3_Pointer)); [L56] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L56] COND FALSE !((*(var_1_9_Pointer))) [L65] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) [L65] EXPR \read(*var_1_1_Pointer) [L65] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) VAL [isInitial=1, stepLocal_0=-4, stepLocal_2=17, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L65] signed long int stepLocal_1 = (((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))); [L66] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L66] COND FALSE !((8 * (*(var_1_1_Pointer))) == stepLocal_1) [L77] EXPR \read(*var_1_10_Pointer) [L77] (*(var_1_4_Pointer)) = (*(var_1_10_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L104] EXPR (-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR ((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) [L104] EXPR \read(*var_1_4_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) [L104] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1 [L104] EXPR (*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1 VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR ((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104-L105] return (((((-4 >= (*(var_1_15_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(var_1_1_Pointer))) == ((((10) > ((*(var_1_1_Pointer)))) ? (10) : ((*(var_1_1_Pointer)))))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_4_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) < (*(var_1_14_Pointer))) && (*(var_1_9_Pointer))))) : (((*(var_1_14_Pointer)) >= (((((*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer)))))) ? ((*(var_1_4_Pointer)) == ((unsigned char) (! (*(var_1_9_Pointer))))) : ((*(var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(var_1_4_Pointer)) == ((unsigned char) (*(var_1_10_Pointer)))))) && ((*(var_1_9_Pointer)) ? (((*(var_1_3_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) (((((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) > ((*(var_1_13_Pointer)))) ? ((((((*(var_1_12_Pointer))) > (16.5)) ? ((*(var_1_12_Pointer))) : (16.5)))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_10_Pointer)) ? ((*(var_1_11_Pointer)) == ((double) (*(var_1_12_Pointer)))) : 1)) : 1)) && ((*(var_1_14_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2089 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2089 mSDsluCounter, 10211 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7770 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1033 IncrementalHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 2441 mSDtfsCounter, 1033 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=13, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1028 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1441 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 3436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 3432/3432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 02:12:46,197 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...