/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-25.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:25:02,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:25:02,680 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-16 04:25:02,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:25:02,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:25:02,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:25:02,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:25:02,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:25:02,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:25:02,714 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:25:02,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:25:02,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:25:02,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:25:02,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:25:02,716 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:25:02,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:25:02,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:25:02,717 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:25:02,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:25:02,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:25:02,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:25:02,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:25:02,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:25:02,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:25:02,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:25:02,719 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:25:02,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:25:02,720 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:25:02,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:25:02,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:25:02,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:25:02,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:25:02,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:25:02,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:25:02,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:25:02,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:25:02,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:25:02,723 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-16 04:25:02,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:25:02,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:25:02,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:25:02,943 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:25:02,943 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:25:02,944 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-25.i [2023-12-16 04:25:03,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:25:04,117 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:25:04,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i [2023-12-16 04:25:04,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf530aba/694e281ad9a046778a9ba455bd20930d/FLAG282f3ba2b [2023-12-16 04:25:04,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf530aba/694e281ad9a046778a9ba455bd20930d [2023-12-16 04:25:04,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:25:04,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:25:04,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:25:04,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:25:04,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:25:04,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e32db1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04, skipping insertion in model container [2023-12-16 04:25:04,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,184 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:25:04,305 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-25.i[916,929] [2023-12-16 04:25:04,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:25:04,349 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:25:04,357 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-25.i[916,929] [2023-12-16 04:25:04,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:25:04,396 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:25:04,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04 WrapperNode [2023-12-16 04:25:04,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:25:04,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:25:04,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:25:04,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:25:04,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,446 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 592 [2023-12-16 04:25:04,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:25:04,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:25:04,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:25:04,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:25:04,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,481 INFO L175 MemorySlicer]: Split 146 memory accesses to 15 slices as follows [2, 7, 6, 10, 10, 8, 8, 12, 9, 26, 16, 5, 9, 8, 10]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1]. [2023-12-16 04:25:04,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:25:04,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:25:04,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:25:04,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:25:04,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (1/1) ... [2023-12-16 04:25:04,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:25:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:25:04,534 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-16 04:25:04,550 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-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-16 04:25:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:25:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:25:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-16 04:25:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-16 04:25:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-16 04:25:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:25:04,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:25:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-16 04:25:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:25:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:25:04,765 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:25:04,766 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:25:05,197 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:25:05,224 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:25:05,224 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:25:05,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:25:05 BoogieIcfgContainer [2023-12-16 04:25:05,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:25:05,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:25:05,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:25:05,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:25:05,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:25:04" (1/3) ... [2023-12-16 04:25:05,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7a85a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:25:05, skipping insertion in model container [2023-12-16 04:25:05,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:04" (2/3) ... [2023-12-16 04:25:05,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7a85a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:25:05, skipping insertion in model container [2023-12-16 04:25:05,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:25:05" (3/3) ... [2023-12-16 04:25:05,234 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-25.i [2023-12-16 04:25:05,279 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:25:05,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:25:05,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:25:05,319 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;@ffe5241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:25:05,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:25:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 97 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:25:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:25:05,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:05,332 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:05,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:05,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 581055530, now seen corresponding path program 1 times [2023-12-16 04:25:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266342906] [2023-12-16 04:25:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:05,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:05,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266342906] [2023-12-16 04:25:05,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266342906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:05,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:05,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:25:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598773241] [2023-12-16 04:25:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:05,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:25:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:25:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:25:05,781 INFO L87 Difference]: Start difference. First operand has 117 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 97 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:25:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:05,831 INFO L93 Difference]: Finished difference Result 231 states and 368 transitions. [2023-12-16 04:25:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:25:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2023-12-16 04:25:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:05,842 INFO L225 Difference]: With dead ends: 231 [2023-12-16 04:25:05,842 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 04:25:05,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-16 04:25:05,848 INFO L413 NwaCegarLoop]: 167 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, 167 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-16 04:25:05,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:25:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 04:25:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-16 04:25:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:25:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2023-12-16 04:25:05,879 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 139 [2023-12-16 04:25:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:05,879 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2023-12-16 04:25:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:25:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2023-12-16 04:25:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:25:05,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:05,882 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:05,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:25:05,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:05,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1754928266, now seen corresponding path program 1 times [2023-12-16 04:25:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023739247] [2023-12-16 04:25:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023739247] [2023-12-16 04:25:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023739247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:07,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:25:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144449512] [2023-12-16 04:25:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:07,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:25:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:25:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:25:07,302 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:25:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:07,920 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2023-12-16 04:25:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:25:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2023-12-16 04:25:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:07,925 INFO L225 Difference]: With dead ends: 359 [2023-12-16 04:25:07,926 INFO L226 Difference]: Without dead ends: 245 [2023-12-16 04:25:07,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:25:07,930 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 353 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:07,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1339 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:25:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-16 04:25:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 190. [2023-12-16 04:25:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 159 states have (on average 1.4088050314465408) internal successors, (224), 160 states have internal predecessors, (224), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:25:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 280 transitions. [2023-12-16 04:25:07,971 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 280 transitions. Word has length 139 [2023-12-16 04:25:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:07,972 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 280 transitions. [2023-12-16 04:25:07,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:25:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2023-12-16 04:25:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:25:07,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:07,977 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:07,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:25:07,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:07,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1441655351, now seen corresponding path program 1 times [2023-12-16 04:25:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637955607] [2023-12-16 04:25:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:08,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637955607] [2023-12-16 04:25:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637955607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:08,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:25:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566151532] [2023-12-16 04:25:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:08,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:25:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:25:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:25:08,225 INFO L87 Difference]: Start difference. First operand 190 states and 280 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:08,363 INFO L93 Difference]: Finished difference Result 468 states and 687 transitions. [2023-12-16 04:25:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:25:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-16 04:25:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:08,368 INFO L225 Difference]: With dead ends: 468 [2023-12-16 04:25:08,368 INFO L226 Difference]: Without dead ends: 279 [2023-12-16 04:25:08,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 04:25:08,372 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 202 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:08,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 774 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-16 04:25:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2023-12-16 04:25:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 195 states have internal predecessors, (263), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:25:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 355 transitions. [2023-12-16 04:25:08,394 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 355 transitions. Word has length 140 [2023-12-16 04:25:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:08,395 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 355 transitions. [2023-12-16 04:25:08,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 355 transitions. [2023-12-16 04:25:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 04:25:08,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:08,396 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:08,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:25:08,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:08,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2128615160, now seen corresponding path program 1 times [2023-12-16 04:25:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735926113] [2023-12-16 04:25:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:08,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735926113] [2023-12-16 04:25:08,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735926113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:08,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:25:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667040582] [2023-12-16 04:25:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:08,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:25:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:25:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:25:08,550 INFO L87 Difference]: Start difference. First operand 244 states and 355 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:08,602 INFO L93 Difference]: Finished difference Result 523 states and 766 transitions. [2023-12-16 04:25:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:25:08,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2023-12-16 04:25:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:08,604 INFO L225 Difference]: With dead ends: 523 [2023-12-16 04:25:08,604 INFO L226 Difference]: Without dead ends: 304 [2023-12-16 04:25:08,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:25:08,605 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 93 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:08,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 714 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:25:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-16 04:25:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 248. [2023-12-16 04:25:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 199 states have internal predecessors, (267), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:25:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2023-12-16 04:25:08,626 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 141 [2023-12-16 04:25:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:08,626 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2023-12-16 04:25:08,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2023-12-16 04:25:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:25:08,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:08,627 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:08,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:25:08,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:08,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash -858275629, now seen corresponding path program 1 times [2023-12-16 04:25:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291289082] [2023-12-16 04:25:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291289082] [2023-12-16 04:25:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291289082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:08,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:25:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422096888] [2023-12-16 04:25:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:08,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:25:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:25:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:25:08,837 INFO L87 Difference]: Start difference. First operand 248 states and 359 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:08,954 INFO L93 Difference]: Finished difference Result 472 states and 685 transitions. [2023-12-16 04:25:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:25:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-16 04:25:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:08,955 INFO L225 Difference]: With dead ends: 472 [2023-12-16 04:25:08,956 INFO L226 Difference]: Without dead ends: 249 [2023-12-16 04:25:08,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 04:25:08,957 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 181 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:08,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 832 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-16 04:25:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2023-12-16 04:25:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 190 states have (on average 1.3473684210526315) internal successors, (256), 192 states have internal predecessors, (256), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:25:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 348 transitions. [2023-12-16 04:25:08,979 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 348 transitions. Word has length 143 [2023-12-16 04:25:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:08,979 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 348 transitions. [2023-12-16 04:25:08,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 348 transitions. [2023-12-16 04:25:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-16 04:25:08,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:08,980 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:08,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:25:08,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:08,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1682031789, now seen corresponding path program 1 times [2023-12-16 04:25:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:08,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088114740] [2023-12-16 04:25:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 04:25:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088114740] [2023-12-16 04:25:09,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088114740] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:25:09,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953916743] [2023-12-16 04:25:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:25:09,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:25:09,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:25:09,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:25:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:09,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 04:25:09,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:25:10,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:25:10,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:25:10,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-16 04:25:10,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-16 04:25:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 04:25:10,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:25:10,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-12-16 04:25:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-16 04:25:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953916743] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:25:10,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:25:10,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-12-16 04:25:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343584] [2023-12-16 04:25:10,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:25:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 04:25:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 04:25:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:25:10,663 INFO L87 Difference]: Start difference. First operand 241 states and 348 transitions. Second operand has 20 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 7 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 5 states have call predecessors, (37), 7 states have call successors, (37) [2023-12-16 04:25:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:11,520 INFO L93 Difference]: Finished difference Result 596 states and 853 transitions. [2023-12-16 04:25:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:25:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 7 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 5 states have call predecessors, (37), 7 states have call successors, (37) Word has length 143 [2023-12-16 04:25:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:11,523 INFO L225 Difference]: With dead ends: 596 [2023-12-16 04:25:11,523 INFO L226 Difference]: Without dead ends: 380 [2023-12-16 04:25:11,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 308 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 04:25:11,525 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1691 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:11,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 1252 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:25:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-12-16 04:25:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 251. [2023-12-16 04:25:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 200 states have internal predecessors, (264), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:25:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 356 transitions. [2023-12-16 04:25:11,556 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 356 transitions. Word has length 143 [2023-12-16 04:25:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:11,556 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 356 transitions. [2023-12-16 04:25:11,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 7 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 5 states have call predecessors, (37), 7 states have call successors, (37) [2023-12-16 04:25:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2023-12-16 04:25:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 04:25:11,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:11,558 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:11,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:25:11,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-16 04:25:11,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:11,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:11,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1681983488, now seen corresponding path program 1 times [2023-12-16 04:25:11,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:11,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290870579] [2023-12-16 04:25:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:11,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290870579] [2023-12-16 04:25:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290870579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:25:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130631271] [2023-12-16 04:25:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:12,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:25:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:12,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:25:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:25:12,053 INFO L87 Difference]: Start difference. First operand 251 states and 356 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:12,156 INFO L93 Difference]: Finished difference Result 564 states and 803 transitions. [2023-12-16 04:25:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:25:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2023-12-16 04:25:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:12,158 INFO L225 Difference]: With dead ends: 564 [2023-12-16 04:25:12,158 INFO L226 Difference]: Without dead ends: 338 [2023-12-16 04:25:12,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:25:12,160 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 209 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:12,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 931 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-12-16 04:25:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 308. [2023-12-16 04:25:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 252 states have (on average 1.3531746031746033) internal successors, (341), 255 states have internal predecessors, (341), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 04:25:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 437 transitions. [2023-12-16 04:25:12,201 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 437 transitions. Word has length 144 [2023-12-16 04:25:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:12,201 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 437 transitions. [2023-12-16 04:25:12,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 437 transitions. [2023-12-16 04:25:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:25:12,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:12,203 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:12,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:25:12,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:12,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1143046917, now seen corresponding path program 1 times [2023-12-16 04:25:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165393310] [2023-12-16 04:25:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165393310] [2023-12-16 04:25:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165393310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 04:25:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769448455] [2023-12-16 04:25:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:13,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:25:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:13,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:25:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:25:13,429 INFO L87 Difference]: Start difference. First operand 308 states and 437 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:25:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:14,295 INFO L93 Difference]: Finished difference Result 742 states and 1060 transitions. [2023-12-16 04:25:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:25:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2023-12-16 04:25:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:14,297 INFO L225 Difference]: With dead ends: 742 [2023-12-16 04:25:14,298 INFO L226 Difference]: Without dead ends: 459 [2023-12-16 04:25:14,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 04:25:14,299 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 738 mSDsluCounter, 2327 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:14,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 2611 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:25:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-12-16 04:25:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 332. [2023-12-16 04:25:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 276 states have (on average 1.3623188405797102) internal successors, (376), 279 states have internal predecessors, (376), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 04:25:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2023-12-16 04:25:14,325 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 146 [2023-12-16 04:25:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:14,325 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2023-12-16 04:25:14,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-16 04:25:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2023-12-16 04:25:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:25:14,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:14,326 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:14,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:25:14,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:14,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash -884881479, now seen corresponding path program 1 times [2023-12-16 04:25:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:14,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409745952] [2023-12-16 04:25:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409745952] [2023-12-16 04:25:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409745952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:25:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901801461] [2023-12-16 04:25:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:14,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:25:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:25:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:25:14,841 INFO L87 Difference]: Start difference. First operand 332 states and 472 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:15,045 INFO L93 Difference]: Finished difference Result 739 states and 1053 transitions. [2023-12-16 04:25:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:25:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-12-16 04:25:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:15,059 INFO L225 Difference]: With dead ends: 739 [2023-12-16 04:25:15,059 INFO L226 Difference]: Without dead ends: 432 [2023-12-16 04:25:15,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:25:15,061 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 164 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:15,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1221 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-16 04:25:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 328. [2023-12-16 04:25:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 272 states have (on average 1.3602941176470589) internal successors, (370), 275 states have internal predecessors, (370), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 04:25:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 466 transitions. [2023-12-16 04:25:15,086 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 466 transitions. Word has length 146 [2023-12-16 04:25:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 466 transitions. [2023-12-16 04:25:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 466 transitions. [2023-12-16 04:25:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:25:15,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:15,090 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:15,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:25:15,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:15,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1081007303, now seen corresponding path program 1 times [2023-12-16 04:25:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088167792] [2023-12-16 04:25:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088167792] [2023-12-16 04:25:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088167792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:25:15,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236770017] [2023-12-16 04:25:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:15,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:25:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:25:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:25:15,595 INFO L87 Difference]: Start difference. First operand 328 states and 466 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:15,757 INFO L93 Difference]: Finished difference Result 669 states and 947 transitions. [2023-12-16 04:25:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:25:15,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-12-16 04:25:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:15,759 INFO L225 Difference]: With dead ends: 669 [2023-12-16 04:25:15,759 INFO L226 Difference]: Without dead ends: 366 [2023-12-16 04:25:15,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:25:15,760 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 183 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:15,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1127 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:25:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-16 04:25:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 296. [2023-12-16 04:25:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 243 states have internal predecessors, (323), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:25:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2023-12-16 04:25:15,788 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 146 [2023-12-16 04:25:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:15,788 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2023-12-16 04:25:15,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2023-12-16 04:25:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:25:15,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:15,790 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:15,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:25:15,790 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:15,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -822841865, now seen corresponding path program 1 times [2023-12-16 04:25:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:15,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939524846] [2023-12-16 04:25:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:25:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:25:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:25:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:25:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:25:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:25:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:25:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:25:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:25:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:25:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:25:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:25:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 04:25:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:25:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:25:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:25:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:25:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-16 04:25:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:25:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:25:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:25:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939524846] [2023-12-16 04:25:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939524846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:25:16,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:25:16,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:25:16,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171039463] [2023-12-16 04:25:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:25:16,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:25:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:25:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:25:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:25:16,535 INFO L87 Difference]: Start difference. First operand 296 states and 415 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:25:17,076 INFO L93 Difference]: Finished difference Result 671 states and 945 transitions. [2023-12-16 04:25:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:25:17,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-12-16 04:25:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:25:17,080 INFO L225 Difference]: With dead ends: 671 [2023-12-16 04:25:17,080 INFO L226 Difference]: Without dead ends: 404 [2023-12-16 04:25:17,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:25:17,081 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 281 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:25:17,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 2463 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:25:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-16 04:25:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 341. [2023-12-16 04:25:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 283 states have internal predecessors, (376), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:25:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2023-12-16 04:25:17,115 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 146 [2023-12-16 04:25:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:25:17,115 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2023-12-16 04:25:17,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:25:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2023-12-16 04:25:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:25:17,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:25:17,117 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:25:17,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:25:17,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:25:17,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:25:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash -214468946, now seen corresponding path program 1 times [2023-12-16 04:25:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:25:17,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29571421] [2023-12-16 04:25:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:25:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:25:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:25:17,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:25:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:25:17,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:25:17,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:25:17,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:25:17,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:25:17,281 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:25:17,283 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:25:17,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:25:17 BoogieIcfgContainer [2023-12-16 04:25:17,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:25:17,440 INFO L158 Benchmark]: Toolchain (without parser) took 13292.39ms. Allocated memory was 247.5MB in the beginning and 497.0MB in the end (delta: 249.6MB). Free memory was 194.1MB in the beginning and 204.1MB in the end (delta: -10.1MB). Peak memory consumption was 240.5MB. Max. memory is 8.0GB. [2023-12-16 04:25:17,440 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 205.5MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:25:17,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.51ms. Allocated memory is still 247.5MB. Free memory was 194.1MB in the beginning and 179.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:25:17,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.19ms. Allocated memory is still 247.5MB. Free memory was 179.4MB in the beginning and 175.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:25:17,441 INFO L158 Benchmark]: Boogie Preprocessor took 61.80ms. Allocated memory is still 247.5MB. Free memory was 175.7MB in the beginning and 170.0MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:25:17,441 INFO L158 Benchmark]: RCFGBuilder took 715.02ms. Allocated memory is still 247.5MB. Free memory was 170.0MB in the beginning and 123.8MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2023-12-16 04:25:17,441 INFO L158 Benchmark]: TraceAbstraction took 12213.37ms. Allocated memory was 247.5MB in the beginning and 497.0MB in the end (delta: 249.6MB). Free memory was 123.3MB in the beginning and 204.1MB in the end (delta: -80.9MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2023-12-16 04:25:17,444 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.12ms. Allocated memory is still 205.5MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.51ms. Allocated memory is still 247.5MB. Free memory was 194.1MB in the beginning and 179.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.19ms. Allocated memory is still 247.5MB. Free memory was 179.4MB in the beginning and 175.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.80ms. Allocated memory is still 247.5MB. Free memory was 175.7MB in the beginning and 170.0MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 715.02ms. Allocated memory is still 247.5MB. Free memory was 170.0MB in the beginning and 123.8MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12213.37ms. Allocated memory was 247.5MB in the beginning and 497.0MB in the end (delta: 249.6MB). Free memory was 123.3MB in the beginning and 204.1MB in the end (delta: -80.9MB). Peak memory consumption was 169.2MB. 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 someBinaryFLOATComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L22] unsigned long int var_1_1 = 256; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 10; [L26] unsigned short int var_1_3 = 10; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned short int var_1_4 = 500; [L28] unsigned short int var_1_4 = 500; [L29] unsigned short int* var_1_4_Pointer = &(var_1_4); [L30] unsigned long int var_1_5 = 0; [L30] unsigned long int var_1_5 = 0; [L31] unsigned long int* var_1_5_Pointer = &(var_1_5); [L32] unsigned long int var_1_6 = 1509114200; [L32] unsigned long int var_1_6 = 1509114200; [L33] unsigned long int* var_1_6_Pointer = &(var_1_6); [L34] unsigned long int var_1_7 = 10; [L34] unsigned long int var_1_7 = 10; [L35] unsigned long int* var_1_7_Pointer = &(var_1_7); [L36] float var_1_8 = 128.9; [L36] float var_1_8 = 128.9; [L37] float* var_1_8_Pointer = &(var_1_8); [L38] float var_1_9 = 63.363; [L38] float var_1_9 = 63.363; [L39] float* var_1_9_Pointer = &(var_1_9); [L40] float var_1_10 = 4.575; [L40] float var_1_10 = 4.575; [L41] float* var_1_10_Pointer = &(var_1_10); [L42] float var_1_11 = 25.5; [L42] float var_1_11 = 25.5; [L43] float* var_1_11_Pointer = &(var_1_11); [L44] unsigned char var_1_12 = 1; [L44] unsigned char var_1_12 = 1; [L45] unsigned char* var_1_12_Pointer = &(var_1_12); [L46] unsigned char var_1_13 = 0; [L46] unsigned char var_1_13 = 0; [L47] unsigned char* var_1_13_Pointer = &(var_1_13); [L48] unsigned char var_1_14 = 1; [L48] unsigned char var_1_14 = 1; [L49] unsigned char* var_1_14_Pointer = &(var_1_14); [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] FCALL updateLastVariables() [L125] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] var_1_3 = __VERIFIER_nondet_ushort() [L89] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] var_1_4 = __VERIFIER_nondet_ushort() [L92] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] var_1_6 = __VERIFIER_nondet_ulong() [L98] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] var_1_7 = __VERIFIER_nondet_ulong() [L101] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] var_1_9 = __VERIFIER_nondet_float() [L104] EXPR \read(var_1_9) [L104] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L104] EXPR \read(var_1_9) [L104] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] var_1_10 = __VERIFIER_nondet_float() [L106] EXPR \read(var_1_10) [L106] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L106] EXPR \read(var_1_10) [L106] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] var_1_13 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] var_1_14 = __VERIFIER_nondet_uchar() [L111] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L125] RET updateVariables() [L126] CALL step() [L53] EXPR \read(*var_1_9_Pointer) [L53] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L53] COND FALSE !((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) [L60] EXPR \read(*var_1_14_Pointer) [L60] (*(var_1_12_Pointer)) = (*(var_1_14_Pointer)) [L62] EXPR \read(*var_1_3_Pointer) [L62] unsigned short int stepLocal_0 = (*(var_1_3_Pointer)); [L63] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L63] COND TRUE (*(var_1_12_Pointer)) [L64] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L64] COND FALSE !(stepLocal_0 <= (*(var_1_4_Pointer))) [L70] EXPR \read(*var_1_1_Pointer) [L70] unsigned long int stepLocal_1 = (*(var_1_1_Pointer)); [L71] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L71] COND TRUE (*(var_1_7_Pointer)) >= stepLocal_1 [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L72] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) [L72] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) VAL [isInitial=1, stepLocal_0=19, stepLocal_1=256, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L72] (*(var_1_8_Pointer)) = ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))) [L76] EXPR \read(*var_1_10_Pointer) [L76] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] EXPR ((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer))) [L76] EXPR ((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer))) VAL [isInitial=1, stepLocal_0=19, stepLocal_1=256, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] EXPR ((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer))) [L76] EXPR \read(*var_1_8_Pointer) [L76] EXPR ((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, stepLocal_0=19, stepLocal_1=256, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] COND TRUE (*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer))))) [L77] EXPR \read(*var_1_10_Pointer) [L77] (*(var_1_11_Pointer)) = (*(var_1_10_Pointer)) [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) [L117] EXPR \read(*var_1_3_Pointer) [L117] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1 [L117] EXPR ((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) [L117] EXPR \read(*var_1_7_Pointer) [L117] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) [L117] EXPR \read(*var_1_8_Pointer) [L117] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) [L117] EXPR ((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR (((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1))) && (((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) || (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] EXPR ((((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1))) && (((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) || (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117-L118] return ((((*(var_1_12_Pointer)) ? (((*(var_1_3_Pointer)) <= (*(var_1_4_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned long int) ((((((*(var_1_3_Pointer))) > (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))))) + ((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))))) : 1) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) && (((*(var_1_7_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) ((((0.5f) < ((*(var_1_9_Pointer)))) ? (0.5f) : ((*(var_1_9_Pointer))))))) : ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((*(var_1_10_Pointer)) >= ((((((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) < ((*(var_1_8_Pointer)))) ? (((((128.175f) > ((*(var_1_9_Pointer)))) ? (128.175f) : ((*(var_1_9_Pointer)))))) : ((*(var_1_8_Pointer)))))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_10_Pointer)))) : ((! ((*(var_1_7_Pointer)) <= (*(var_1_6_Pointer)))) ? ((*(var_1_11_Pointer)) == ((float) (*(var_1_9_Pointer)))) : 1))) && (((*(var_1_9_Pointer)) != (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) || (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer))))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4095 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4095 mSDsluCounter, 13431 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10939 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2438 IncrementalHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 2492 mSDtfsCounter, 2438 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 863 GetRequests, 714 SyntacticMatches, 4 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 677 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1862 NumberOfCodeBlocks, 1862 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1846 ConstructedInterpolants, 0 QuantifiedInterpolants, 9989 SizeOfPredicates, 12 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 7819/7956 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-16 04:25:17,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...