/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:36:37,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:36:38,070 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-15 21:36:38,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:36:38,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:36:38,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:36:38,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:36:38,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:36:38,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:36:38,111 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:36:38,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:36:38,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:36:38,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:36:38,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:36:38,114 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:36:38,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:36:38,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:36:38,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:36:38,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:36:38,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:36:38,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:36:38,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:36:38,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:36:38,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:36:38,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:36:38,117 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:36:38,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:36:38,117 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:36:38,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:36:38,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:36:38,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:36:38,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:36:38,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:36:38,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:36:38,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:36:38,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:36:38,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:36:38,120 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:36:38,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:36:38,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:36:38,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:36:38,384 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:36:38,384 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:36:38,385 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-15 21:36:39,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:36:39,745 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:36:39,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-25.i [2023-12-15 21:36:39,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eb46627/557e2ae0e97b4f6f99477422cc7e866a/FLAG3c63cfc66 [2023-12-15 21:36:39,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4eb46627/557e2ae0e97b4f6f99477422cc7e866a [2023-12-15 21:36:39,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:36:39,772 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:36:39,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:36:39,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:36:39,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:36:39,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:36:39" (1/1) ... [2023-12-15 21:36:39,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ffa892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:39, skipping insertion in model container [2023-12-15 21:36:39,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:36:39" (1/1) ... [2023-12-15 21:36:39,817 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:36:39,964 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-15 21:36:40,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:36:40,026 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:36:40,037 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-15 21:36:40,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:36:40,079 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:36:40,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40 WrapperNode [2023-12-15 21:36:40,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:36:40,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:36:40,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:36:40,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:36:40,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,157 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 592 [2023-12-15 21:36:40,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:36:40,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:36:40,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:36:40,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:36:40,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,212 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-15 21:36:40,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:36:40,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:36:40,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:36:40,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:36:40,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (1/1) ... [2023-12-15 21:36:40,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:36:40,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:40,309 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-15 21:36:40,334 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-15 21:36:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:36:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:36:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:36:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:36:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:36:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:36:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:36:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-15 21:36:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-15 21:36:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-15 21:36:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-15 21:36:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-15 21:36:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-15 21:36:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-15 21:36:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-15 21:36:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-15 21:36:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-15 21:36:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-15 21:36:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-15 21:36:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-15 21:36:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-15 21:36:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-15 21:36:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-15 21:36:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-15 21:36:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-15 21:36:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-15 21:36:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-15 21:36:40,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-15 21:36:40,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:36:40,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-15 21:36:40,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-15 21:36:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-15 21:36:40,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-15 21:36:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-15 21:36:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:36:40,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 21:36:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-15 21:36:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-15 21:36:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-15 21:36:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-15 21:36:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-15 21:36:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-15 21:36:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-15 21:36:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-15 21:36:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:36:40,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:36:40,605 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:36:40,607 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:36:41,113 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:36:41,183 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:36:41,183 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:36:41,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:36:41 BoogieIcfgContainer [2023-12-15 21:36:41,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:36:41,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:36:41,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:36:41,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:36:41,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:36:39" (1/3) ... [2023-12-15 21:36:41,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4693c537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:36:41, skipping insertion in model container [2023-12-15 21:36:41,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:36:40" (2/3) ... [2023-12-15 21:36:41,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4693c537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:36:41, skipping insertion in model container [2023-12-15 21:36:41,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:36:41" (3/3) ... [2023-12-15 21:36:41,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-25.i [2023-12-15 21:36:41,212 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:36:41,212 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:36:41,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:36:41,257 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;@4625ecee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:36:41,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:36:41,260 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-15 21:36:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-15 21:36:41,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:41,273 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-15 21:36:41,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:41,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 581055530, now seen corresponding path program 1 times [2023-12-15 21:36:41,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841212089] [2023-12-15 21:36:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:41,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:41,684 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-15 21:36:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:41,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841212089] [2023-12-15 21:36:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841212089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:36:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285138759] [2023-12-15 21:36:41,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:41,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:36:41,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:36:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:36:41,737 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-15 21:36:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:41,813 INFO L93 Difference]: Finished difference Result 231 states and 368 transitions. [2023-12-15 21:36:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:36:41,817 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-15 21:36:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:41,826 INFO L225 Difference]: With dead ends: 231 [2023-12-15 21:36:41,826 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 21:36:41,831 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-15 21:36:41,835 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-15 21:36:41,836 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-15 21:36:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 21:36:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-15 21:36:41,886 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-15 21:36:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2023-12-15 21:36:41,889 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 139 [2023-12-15 21:36:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:41,889 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2023-12-15 21:36:41,889 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-15 21:36:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2023-12-15 21:36:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-15 21:36:41,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:41,892 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-15 21:36:41,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:36:41,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:41,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1754928266, now seen corresponding path program 1 times [2023-12-15 21:36:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625794249] [2023-12-15 21:36:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:43,471 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-15 21:36:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:43,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625794249] [2023-12-15 21:36:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625794249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:43,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:43,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:36:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575971754] [2023-12-15 21:36:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:36:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:36:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:36:43,479 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-15 21:36:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:44,262 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2023-12-15 21:36:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:36:44,263 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-15 21:36:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:44,269 INFO L225 Difference]: With dead ends: 359 [2023-12-15 21:36:44,269 INFO L226 Difference]: Without dead ends: 245 [2023-12-15 21:36:44,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:36:44,274 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 353 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:44,275 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.5s Time] [2023-12-15 21:36:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-15 21:36:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 190. [2023-12-15 21:36:44,321 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-15 21:36:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 280 transitions. [2023-12-15 21:36:44,323 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 280 transitions. Word has length 139 [2023-12-15 21:36:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:44,325 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 280 transitions. [2023-12-15 21:36:44,325 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-15 21:36:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2023-12-15 21:36:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-15 21:36:44,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:44,331 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-15 21:36:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:36:44,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:44,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1441655351, now seen corresponding path program 1 times [2023-12-15 21:36:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385262313] [2023-12-15 21:36:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:44,693 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-15 21:36:44,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385262313] [2023-12-15 21:36:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385262313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:44,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153129063] [2023-12-15 21:36:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:44,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:44,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:44,698 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-15 21:36:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:44,874 INFO L93 Difference]: Finished difference Result 468 states and 687 transitions. [2023-12-15 21:36:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:44,875 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-15 21:36:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:44,881 INFO L225 Difference]: With dead ends: 468 [2023-12-15 21:36:44,881 INFO L226 Difference]: Without dead ends: 279 [2023-12-15 21:36:44,884 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-15 21:36:44,886 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-15 21:36:44,887 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-15 21:36:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-15 21:36:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2023-12-15 21:36:44,925 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-15 21:36:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 355 transitions. [2023-12-15 21:36:44,929 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 355 transitions. Word has length 140 [2023-12-15 21:36:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:44,930 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 355 transitions. [2023-12-15 21:36:44,930 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-15 21:36:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 355 transitions. [2023-12-15 21:36:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-15 21:36:44,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:44,932 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-15 21:36:44,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:36:44,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:44,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2128615160, now seen corresponding path program 1 times [2023-12-15 21:36:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508058476] [2023-12-15 21:36:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,202 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-15 21:36:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508058476] [2023-12-15 21:36:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508058476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:45,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886501287] [2023-12-15 21:36:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:45,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:45,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:45,205 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-15 21:36:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:45,280 INFO L93 Difference]: Finished difference Result 523 states and 766 transitions. [2023-12-15 21:36:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:36:45,281 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-15 21:36:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:45,283 INFO L225 Difference]: With dead ends: 523 [2023-12-15 21:36:45,283 INFO L226 Difference]: Without dead ends: 304 [2023-12-15 21:36:45,283 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-15 21:36:45,284 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-15 21:36:45,284 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-15 21:36:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-15 21:36:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 248. [2023-12-15 21:36:45,314 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-15 21:36:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2023-12-15 21:36:45,317 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 141 [2023-12-15 21:36:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:45,318 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2023-12-15 21:36:45,318 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-15 21:36:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2023-12-15 21:36:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-15 21:36:45,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:45,321 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-15 21:36:45,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:36:45,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:45,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -858275629, now seen corresponding path program 1 times [2023-12-15 21:36:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149935638] [2023-12-15 21:36:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:45,611 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-15 21:36:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149935638] [2023-12-15 21:36:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149935638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:36:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672612885] [2023-12-15 21:36:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:45,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:36:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:36:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:36:45,614 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-15 21:36:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:45,769 INFO L93 Difference]: Finished difference Result 472 states and 685 transitions. [2023-12-15 21:36:45,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:36:45,770 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-15 21:36:45,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:45,772 INFO L225 Difference]: With dead ends: 472 [2023-12-15 21:36:45,772 INFO L226 Difference]: Without dead ends: 249 [2023-12-15 21:36:45,773 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-15 21:36:45,773 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-15 21:36:45,774 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-15 21:36:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-15 21:36:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2023-12-15 21:36:45,807 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-15 21:36:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 348 transitions. [2023-12-15 21:36:45,808 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 348 transitions. Word has length 143 [2023-12-15 21:36:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:45,809 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 348 transitions. [2023-12-15 21:36:45,809 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-15 21:36:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 348 transitions. [2023-12-15 21:36:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-15 21:36:45,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:45,811 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-15 21:36:45,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:36:45,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:45,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1682031789, now seen corresponding path program 1 times [2023-12-15 21:36:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583053686] [2023-12-15 21:36:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,446 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-15 21:36:46,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:46,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583053686] [2023-12-15 21:36:46,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583053686] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:36:46,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676779304] [2023-12-15 21:36:46,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:46,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:36:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:36:46,450 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-15 21:36:46,471 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-15 21:36:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:46,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-15 21:36:46,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:36:47,417 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-15 21:36:47,531 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-15 21:36:47,534 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-15 21:36:47,568 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-15 21:36:47,589 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-15 21:36:47,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:36:47,780 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-15 21:36:47,933 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-15 21:36:47,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676779304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:36:47,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:36:47,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-12-15 21:36:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114970404] [2023-12-15 21:36:47,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:36:47,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 21:36:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 21:36:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:36:47,936 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-15 21:36:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:49,035 INFO L93 Difference]: Finished difference Result 596 states and 853 transitions. [2023-12-15 21:36:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:36:49,036 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-15 21:36:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:49,039 INFO L225 Difference]: With dead ends: 596 [2023-12-15 21:36:49,039 INFO L226 Difference]: Without dead ends: 380 [2023-12-15 21:36:49,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 308 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2023-12-15 21:36:49,041 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.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:49,042 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.5s Time] [2023-12-15 21:36:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-12-15 21:36:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 251. [2023-12-15 21:36:49,081 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-15 21:36:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 356 transitions. [2023-12-15 21:36:49,083 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 356 transitions. Word has length 143 [2023-12-15 21:36:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:49,083 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 356 transitions. [2023-12-15 21:36:49,083 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-15 21:36:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 356 transitions. [2023-12-15 21:36:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-15 21:36:49,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:49,085 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-15 21:36:49,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:36:49,295 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-15 21:36:49,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:49,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1681983488, now seen corresponding path program 1 times [2023-12-15 21:36:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130555077] [2023-12-15 21:36:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:49,664 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-15 21:36:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:49,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130555077] [2023-12-15 21:36:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130555077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:49,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:49,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:36:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964485557] [2023-12-15 21:36:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:49,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:36:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:36:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:36:49,666 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-15 21:36:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:49,802 INFO L93 Difference]: Finished difference Result 564 states and 803 transitions. [2023-12-15 21:36:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:36:49,803 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-15 21:36:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:49,805 INFO L225 Difference]: With dead ends: 564 [2023-12-15 21:36:49,805 INFO L226 Difference]: Without dead ends: 338 [2023-12-15 21:36:49,806 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-15 21:36:49,807 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 209 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 21:36:49,807 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-15 21:36:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-12-15 21:36:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 308. [2023-12-15 21:36:49,853 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-15 21:36:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 437 transitions. [2023-12-15 21:36:49,855 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 437 transitions. Word has length 144 [2023-12-15 21:36:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:49,855 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 437 transitions. [2023-12-15 21:36:49,856 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-15 21:36:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 437 transitions. [2023-12-15 21:36:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:36:49,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:49,858 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-15 21:36:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:36:49,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:49,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1143046917, now seen corresponding path program 1 times [2023-12-15 21:36:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:49,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702169402] [2023-12-15 21:36:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:51,672 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-15 21:36:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702169402] [2023-12-15 21:36:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702169402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-15 21:36:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70437607] [2023-12-15 21:36:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:51,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:36:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:36:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:36:51,674 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-15 21:36:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:52,772 INFO L93 Difference]: Finished difference Result 742 states and 1060 transitions. [2023-12-15 21:36:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:36:52,773 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-15 21:36:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:52,776 INFO L225 Difference]: With dead ends: 742 [2023-12-15 21:36:52,776 INFO L226 Difference]: Without dead ends: 459 [2023-12-15 21:36:52,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 21:36:52,779 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 738 mSDsluCounter, 2327 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:36:52,779 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.5s Time] [2023-12-15 21:36:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-12-15 21:36:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 332. [2023-12-15 21:36:52,815 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-15 21:36:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2023-12-15 21:36:52,817 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 146 [2023-12-15 21:36:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:52,817 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2023-12-15 21:36:52,817 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-15 21:36:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2023-12-15 21:36:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:36:52,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:52,819 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-15 21:36:52,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:36:52,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:52,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash -884881479, now seen corresponding path program 1 times [2023-12-15 21:36:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:52,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466673236] [2023-12-15 21:36:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:53,506 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-15 21:36:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466673236] [2023-12-15 21:36:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466673236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:53,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394319785] [2023-12-15 21:36:53,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:53,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:53,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:53,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:53,509 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-15 21:36:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:53,777 INFO L93 Difference]: Finished difference Result 739 states and 1053 transitions. [2023-12-15 21:36:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:36:53,778 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-15 21:36:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:53,780 INFO L225 Difference]: With dead ends: 739 [2023-12-15 21:36:53,780 INFO L226 Difference]: Without dead ends: 432 [2023-12-15 21:36:53,781 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-15 21:36:53,783 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-15 21:36:53,783 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-15 21:36:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-15 21:36:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 328. [2023-12-15 21:36:53,818 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-15 21:36:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 466 transitions. [2023-12-15 21:36:53,820 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 466 transitions. Word has length 146 [2023-12-15 21:36:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:53,823 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 466 transitions. [2023-12-15 21:36:53,823 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-15 21:36:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 466 transitions. [2023-12-15 21:36:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:36:53,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:53,825 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-15 21:36:53,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:36:53,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:53,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1081007303, now seen corresponding path program 1 times [2023-12-15 21:36:53,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:53,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164202570] [2023-12-15 21:36:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:53,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:54,421 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-15 21:36:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164202570] [2023-12-15 21:36:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164202570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:36:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36531510] [2023-12-15 21:36:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:54,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:36:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:54,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:36:54,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:36:54,423 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-15 21:36:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:54,645 INFO L93 Difference]: Finished difference Result 669 states and 947 transitions. [2023-12-15 21:36:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:36:54,646 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-15 21:36:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:54,647 INFO L225 Difference]: With dead ends: 669 [2023-12-15 21:36:54,648 INFO L226 Difference]: Without dead ends: 366 [2023-12-15 21:36:54,648 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-15 21:36:54,649 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-15 21:36:54,650 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-15 21:36:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-15 21:36:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 296. [2023-12-15 21:36:54,686 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-15 21:36:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2023-12-15 21:36:54,688 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 146 [2023-12-15 21:36:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:54,688 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2023-12-15 21:36:54,688 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-15 21:36:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2023-12-15 21:36:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:36:54,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:54,690 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-15 21:36:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:36:54,690 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:54,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -822841865, now seen corresponding path program 1 times [2023-12-15 21:36:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093012212] [2023-12-15 21:36:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:36:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:36:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:36:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:36:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:36:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:36:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:36:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:36:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:36:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:36:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:36:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:36:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:36:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:36:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:36:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:36:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:36:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:36:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:36:55,716 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-15 21:36:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:36:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093012212] [2023-12-15 21:36:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093012212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:36:55,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:36:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:36:55,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941425441] [2023-12-15 21:36:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:36:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:36:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:36:55,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:36:55,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:36:55,718 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-15 21:36:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:36:56,378 INFO L93 Difference]: Finished difference Result 671 states and 945 transitions. [2023-12-15 21:36:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-15 21:36:56,379 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-15 21:36:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:36:56,381 INFO L225 Difference]: With dead ends: 671 [2023-12-15 21:36:56,381 INFO L226 Difference]: Without dead ends: 404 [2023-12-15 21:36:56,382 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-15 21:36:56,382 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 281 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-15 21:36:56,383 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-15 21:36:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-15 21:36:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 341. [2023-12-15 21:36:56,427 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-15 21:36:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 476 transitions. [2023-12-15 21:36:56,429 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 476 transitions. Word has length 146 [2023-12-15 21:36:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:36:56,429 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 476 transitions. [2023-12-15 21:36:56,429 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-15 21:36:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 476 transitions. [2023-12-15 21:36:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:36:56,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:36:56,431 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-15 21:36:56,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:36:56,431 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:36:56,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:36:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash -214468946, now seen corresponding path program 1 times [2023-12-15 21:36:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:36:56,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719185724] [2023-12-15 21:36:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:36:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:36:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:36:56,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:36:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:36:56,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:36:56,648 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:36:56,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:36:56,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:36:56,653 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:36:56,656 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:36:56,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:36:56 BoogieIcfgContainer [2023-12-15 21:36:56,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:36:56,822 INFO L158 Benchmark]: Toolchain (without parser) took 17049.43ms. Allocated memory was 271.6MB in the beginning and 490.7MB in the end (delta: 219.2MB). Free memory was 220.7MB in the beginning and 230.7MB in the end (delta: -10.0MB). Peak memory consumption was 209.9MB. Max. memory is 8.0GB. [2023-12-15 21:36:56,822 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 135.7MB in the beginning and 135.5MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:36:56,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.00ms. Allocated memory is still 271.6MB. Free memory was 220.3MB in the beginning and 205.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:36:56,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.44ms. Allocated memory is still 271.6MB. Free memory was 205.7MB in the beginning and 201.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:36:56,823 INFO L158 Benchmark]: Boogie Preprocessor took 110.05ms. Allocated memory is still 271.6MB. Free memory was 201.9MB in the beginning and 196.2MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:36:56,823 INFO L158 Benchmark]: RCFGBuilder took 915.07ms. Allocated memory is still 271.6MB. Free memory was 196.2MB in the beginning and 233.8MB in the end (delta: -37.5MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-12-15 21:36:56,824 INFO L158 Benchmark]: TraceAbstraction took 15629.18ms. Allocated memory was 271.6MB in the beginning and 490.7MB in the end (delta: 219.2MB). Free memory was 232.2MB in the beginning and 230.7MB in the end (delta: 1.4MB). Peak memory consumption was 220.4MB. Max. memory is 8.0GB. [2023-12-15 21:36:56,826 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 185.6MB. Free memory was 135.7MB in the beginning and 135.5MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.00ms. Allocated memory is still 271.6MB. Free memory was 220.3MB in the beginning and 205.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.44ms. Allocated memory is still 271.6MB. Free memory was 205.7MB in the beginning and 201.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 110.05ms. Allocated memory is still 271.6MB. Free memory was 201.9MB in the beginning and 196.2MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 915.07ms. Allocated memory is still 271.6MB. Free memory was 196.2MB in the beginning and 233.8MB in the end (delta: -37.5MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15629.18ms. Allocated memory was 271.6MB in the beginning and 490.7MB in the end (delta: 219.2MB). Free memory was 232.2MB in the beginning and 230.7MB in the end (delta: 1.4MB). Peak memory consumption was 220.4MB. 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: 15.4s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4095 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4095 mSDsluCounter, 13431 SdHoareTripleChecker+Invalid, 2.1s 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, 2.3s 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 677 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s 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-15 21:36:56,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...