/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:08:28,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:08:29,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-21 02:08:29,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:08:29,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:08:29,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:08:29,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:08:29,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:08:29,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:08:29,099 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:08:29,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:08:29,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:08:29,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:08:29,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:08:29,101 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:08:29,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:08:29,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:08:29,102 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:08:29,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:08:29,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:08:29,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:08:29,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:08:29,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:08:29,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:08:29,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:08:29,104 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:08:29,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:08:29,104 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:08:29,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:08:29,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:08:29,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:08:29,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:08:29,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:08:29,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:08:29,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:08:29,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:08:29,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:08:29,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:08:29,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:08:29,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:08:29,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:08:29,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:08:29,316 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:08:29,316 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-14.i [2023-12-21 02:08:30,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:08:30,481 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:08:30,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-14.i [2023-12-21 02:08:30,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0b87f09/8ccd621aa3c14fee99f648e3a3ff106e/FLAG7ac0ec626 [2023-12-21 02:08:30,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f0b87f09/8ccd621aa3c14fee99f648e3a3ff106e [2023-12-21 02:08:30,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:08:30,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:08:30,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:08:30,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:08:30,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:08:30,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be25ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30, skipping insertion in model container [2023-12-21 02:08:30,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,538 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:08:30,657 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-14.i[916,929] [2023-12-21 02:08:30,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:08:30,695 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:08:30,703 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-14.i[916,929] [2023-12-21 02:08:30,728 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:08:30,741 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:08:30,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30 WrapperNode [2023-12-21 02:08:30,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:08:30,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:08:30,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:08:30,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:08:30,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,802 INFO L138 Inliner]: procedures = 29, calls = 198, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 605 [2023-12-21 02:08:30,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:08:30,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:08:30,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:08:30,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:08:30,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,845 INFO L175 MemorySlicer]: Split 150 memory accesses to 17 slices as follows [2, 3, 6, 6, 9, 6, 12, 20, 10, 8, 6, 9, 8, 11, 8, 8, 18]. 13 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 20 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1]. [2023-12-21 02:08:30,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:08:30,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:08:30,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:08:30,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:08:30,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (1/1) ... [2023-12-21 02:08:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:08:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:08:30,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 02:08:30,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 02:08:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:08:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:08:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:08:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 02:08:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 02:08:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 02:08:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 02:08:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 02:08:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 02:08:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-21 02:08:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-21 02:08:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-21 02:08:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 02:08:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 02:08:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 02:08:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 02:08:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-21 02:08:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-21 02:08:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-21 02:08:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-21 02:08:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-21 02:08:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-21 02:08:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-21 02:08:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:08:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-21 02:08:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 02:08:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 02:08:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 02:08:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 02:08:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2023-12-21 02:08:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:08:30,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 02:08:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-12-21 02:08:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:08:30,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:08:31,153 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:08:31,154 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:08:31,612 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:08:31,651 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:08:31,652 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:08:31,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:08:31 BoogieIcfgContainer [2023-12-21 02:08:31,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:08:31,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:08:31,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:08:31,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:08:31,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:08:30" (1/3) ... [2023-12-21 02:08:31,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7dc803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:08:31, skipping insertion in model container [2023-12-21 02:08:31,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:08:30" (2/3) ... [2023-12-21 02:08:31,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7dc803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:08:31, skipping insertion in model container [2023-12-21 02:08:31,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:08:31" (3/3) ... [2023-12-21 02:08:31,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-14.i [2023-12-21 02:08:31,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:08:31,671 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:08:31,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:08:31,716 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;@45b7d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:08:31,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:08:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 02:08:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 02:08:31,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:31,732 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:31,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:31,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1637353740, now seen corresponding path program 1 times [2023-12-21 02:08:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:31,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765289071] [2023-12-21 02:08:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765289071] [2023-12-21 02:08:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765289071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:32,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:08:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155491600] [2023-12-21 02:08:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:32,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:08:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:32,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:08:32,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:08:32,212 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 02:08:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:32,249 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2023-12-21 02:08:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:08:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-12-21 02:08:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:32,259 INFO L225 Difference]: With dead ends: 239 [2023-12-21 02:08:32,259 INFO L226 Difference]: Without dead ends: 119 [2023-12-21 02:08:32,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:08:32,267 INFO L413 NwaCegarLoop]: 174 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, 174 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:32,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-21 02:08:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-21 02:08:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 02:08:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2023-12-21 02:08:32,320 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2023-12-21 02:08:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:32,321 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2023-12-21 02:08:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 02:08:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2023-12-21 02:08:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 02:08:32,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:32,328 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:32,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:08:32,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:32,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2104975534, now seen corresponding path program 1 times [2023-12-21 02:08:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:32,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817840090] [2023-12-21 02:08:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817840090] [2023-12-21 02:08:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817840090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:08:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291860215] [2023-12-21 02:08:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:32,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:08:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:08:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:08:32,591 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:32,635 INFO L93 Difference]: Finished difference Result 241 states and 362 transitions. [2023-12-21 02:08:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:08:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 02:08:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:32,637 INFO L225 Difference]: With dead ends: 241 [2023-12-21 02:08:32,637 INFO L226 Difference]: Without dead ends: 123 [2023-12-21 02:08:32,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:32,639 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 3 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:32,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 506 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-21 02:08:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-12-21 02:08:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-21 02:08:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2023-12-21 02:08:32,646 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 163 [2023-12-21 02:08:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:32,647 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2023-12-21 02:08:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2023-12-21 02:08:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 02:08:32,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:32,651 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:32,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:08:32,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:32,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -501048020, now seen corresponding path program 1 times [2023-12-21 02:08:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570820057] [2023-12-21 02:08:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:33,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570820057] [2023-12-21 02:08:33,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570820057] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:33,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:33,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:08:33,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025572519] [2023-12-21 02:08:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:33,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:08:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:08:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:08:33,019 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:33,156 INFO L93 Difference]: Finished difference Result 365 states and 542 transitions. [2023-12-21 02:08:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:08:33,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 02:08:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:33,161 INFO L225 Difference]: With dead ends: 365 [2023-12-21 02:08:33,161 INFO L226 Difference]: Without dead ends: 244 [2023-12-21 02:08:33,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:33,166 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 179 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:33,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 505 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-21 02:08:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2023-12-21 02:08:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 02:08:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 322 transitions. [2023-12-21 02:08:33,193 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 322 transitions. Word has length 163 [2023-12-21 02:08:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:33,194 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 322 transitions. [2023-12-21 02:08:33,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 322 transitions. [2023-12-21 02:08:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 02:08:33,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:33,197 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:33,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:08:33,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:33,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1988480942, now seen corresponding path program 1 times [2023-12-21 02:08:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477945210] [2023-12-21 02:08:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:33,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:33,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477945210] [2023-12-21 02:08:33,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477945210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:33,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703352364] [2023-12-21 02:08:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:33,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:33,812 INFO L87 Difference]: Start difference. First operand 217 states and 322 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:33,959 INFO L93 Difference]: Finished difference Result 348 states and 517 transitions. [2023-12-21 02:08:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:08:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 02:08:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:33,962 INFO L225 Difference]: With dead ends: 348 [2023-12-21 02:08:33,962 INFO L226 Difference]: Without dead ends: 221 [2023-12-21 02:08:33,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:08:33,970 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 178 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:33,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 447 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-21 02:08:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2023-12-21 02:08:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 02:08:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2023-12-21 02:08:33,997 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 163 [2023-12-21 02:08:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:33,998 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2023-12-21 02:08:33,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2023-12-21 02:08:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 02:08:34,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:34,000 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:34,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:08:34,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:34,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1719680340, now seen corresponding path program 1 times [2023-12-21 02:08:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715277409] [2023-12-21 02:08:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715277409] [2023-12-21 02:08:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715277409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:34,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:34,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:34,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201822492] [2023-12-21 02:08:34,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:34,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:34,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:34,355 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:34,442 INFO L93 Difference]: Finished difference Result 475 states and 704 transitions. [2023-12-21 02:08:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:08:34,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 02:08:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:34,445 INFO L225 Difference]: With dead ends: 475 [2023-12-21 02:08:34,445 INFO L226 Difference]: Without dead ends: 353 [2023-12-21 02:08:34,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:08:34,446 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 220 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:34,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1063 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-12-21 02:08:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 229. [2023-12-21 02:08:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 02:08:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 338 transitions. [2023-12-21 02:08:34,464 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 338 transitions. Word has length 163 [2023-12-21 02:08:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:34,464 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 338 transitions. [2023-12-21 02:08:34,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2023-12-21 02:08:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-21 02:08:34,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:34,465 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:34,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:08:34,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:34,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash 977363692, now seen corresponding path program 1 times [2023-12-21 02:08:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402408385] [2023-12-21 02:08:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402408385] [2023-12-21 02:08:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402408385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:34,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:08:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178119089] [2023-12-21 02:08:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:34,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:08:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:08:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:08:34,963 INFO L87 Difference]: Start difference. First operand 229 states and 338 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:35,128 INFO L93 Difference]: Finished difference Result 513 states and 756 transitions. [2023-12-21 02:08:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:08:35,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-12-21 02:08:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:35,131 INFO L225 Difference]: With dead ends: 513 [2023-12-21 02:08:35,131 INFO L226 Difference]: Without dead ends: 379 [2023-12-21 02:08:35,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:08:35,132 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 376 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:35,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 711 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-12-21 02:08:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 225. [2023-12-21 02:08:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 180 states have (on average 1.3555555555555556) internal successors, (244), 180 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-21 02:08:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2023-12-21 02:08:35,144 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 163 [2023-12-21 02:08:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:35,144 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2023-12-21 02:08:35,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2023-12-21 02:08:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-21 02:08:35,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:35,146 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:35,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:08:35,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:35,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 980123987, now seen corresponding path program 1 times [2023-12-21 02:08:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093882148] [2023-12-21 02:08:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-21 02:08:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093882148] [2023-12-21 02:08:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093882148] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:08:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870266564] [2023-12-21 02:08:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:35,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:08:35,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:08:35,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:08:36,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 02:08:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:36,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 02:08:36,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:08:36,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 02:08:37,716 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-21 02:08:37,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 02:08:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 10 proven. 470 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-21 02:08:37,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:08:38,047 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 42 treesize of output 34 [2023-12-21 02:08:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-21 02:08:38,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870266564] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:08:38,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:08:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2023-12-21 02:08:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713868189] [2023-12-21 02:08:38,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:08:38,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-21 02:08:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-21 02:08:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2023-12-21 02:08:38,212 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 27 states, 23 states have (on average 7.086956521739131) internal successors, (163), 25 states have internal predecessors, (163), 11 states have call successors, (63), 4 states have call predecessors, (63), 6 states have return successors, (63), 8 states have call predecessors, (63), 11 states have call successors, (63) [2023-12-21 02:08:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:39,883 INFO L93 Difference]: Finished difference Result 635 states and 908 transitions. [2023-12-21 02:08:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-21 02:08:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 7.086956521739131) internal successors, (163), 25 states have internal predecessors, (163), 11 states have call successors, (63), 4 states have call predecessors, (63), 6 states have return successors, (63), 8 states have call predecessors, (63), 11 states have call successors, (63) Word has length 165 [2023-12-21 02:08:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:39,886 INFO L225 Difference]: With dead ends: 635 [2023-12-21 02:08:39,886 INFO L226 Difference]: Without dead ends: 500 [2023-12-21 02:08:39,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=709, Invalid=2713, Unknown=0, NotChecked=0, Total=3422 [2023-12-21 02:08:39,887 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2532 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2532 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:39,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2532 Valid, 1767 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 02:08:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-12-21 02:08:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 353. [2023-12-21 02:08:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 283 states have (on average 1.332155477031802) internal successors, (377), 283 states have internal predecessors, (377), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-21 02:08:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 503 transitions. [2023-12-21 02:08:39,913 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 503 transitions. Word has length 165 [2023-12-21 02:08:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:39,914 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 503 transitions. [2023-12-21 02:08:39,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 7.086956521739131) internal successors, (163), 25 states have internal predecessors, (163), 11 states have call successors, (63), 4 states have call predecessors, (63), 6 states have return successors, (63), 8 states have call predecessors, (63), 11 states have call successors, (63) [2023-12-21 02:08:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 503 transitions. [2023-12-21 02:08:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-21 02:08:39,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:39,915 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:39,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 02:08:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:08:40,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:40,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1649448621, now seen corresponding path program 1 times [2023-12-21 02:08:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013270317] [2023-12-21 02:08:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-21 02:08:41,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013270317] [2023-12-21 02:08:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013270317] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:08:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049555946] [2023-12-21 02:08:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:41,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:08:41,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:08:41,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:08:41,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 02:08:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:41,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-21 02:08:41,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:08:41,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 02:08:42,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 02:08:43,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 100 treesize of output 87 [2023-12-21 02:08:43,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 22 [2023-12-21 02:08:43,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 24 [2023-12-21 02:08:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 480 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2023-12-21 02:08:44,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:08:44,415 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 89 treesize of output 85 [2023-12-21 02:08:44,429 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-12-21 02:08:44,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 1 [2023-12-21 02:08:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049555946] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:08:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:08:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15, 24] total 41 [2023-12-21 02:08:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268969868] [2023-12-21 02:08:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:44,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:08:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:08:44,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 02:08:44,496 INFO L87 Difference]: Start difference. First operand 353 states and 503 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:44,882 INFO L93 Difference]: Finished difference Result 709 states and 1004 transitions. [2023-12-21 02:08:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:08:44,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2023-12-21 02:08:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:44,884 INFO L225 Difference]: With dead ends: 709 [2023-12-21 02:08:44,884 INFO L226 Difference]: Without dead ends: 460 [2023-12-21 02:08:44,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=1752, Unknown=0, NotChecked=0, Total=1980 [2023-12-21 02:08:44,885 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 237 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:44,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1296 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:08:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-12-21 02:08:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 437. [2023-12-21 02:08:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 358 states have (on average 1.329608938547486) internal successors, (476), 359 states have internal predecessors, (476), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-21 02:08:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 614 transitions. [2023-12-21 02:08:44,911 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 614 transitions. Word has length 165 [2023-12-21 02:08:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:44,912 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 614 transitions. [2023-12-21 02:08:44,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 614 transitions. [2023-12-21 02:08:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-21 02:08:44,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:44,913 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:44,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 02:08:45,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-21 02:08:45,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:45,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 997019910, now seen corresponding path program 1 times [2023-12-21 02:08:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840085900] [2023-12-21 02:08:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840085900] [2023-12-21 02:08:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840085900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:45,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:08:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211156600] [2023-12-21 02:08:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:08:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:08:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:08:45,699 INFO L87 Difference]: Start difference. First operand 437 states and 614 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:45,886 INFO L93 Difference]: Finished difference Result 921 states and 1288 transitions. [2023-12-21 02:08:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:08:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2023-12-21 02:08:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:45,891 INFO L225 Difference]: With dead ends: 921 [2023-12-21 02:08:45,891 INFO L226 Difference]: Without dead ends: 592 [2023-12-21 02:08:45,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:08:45,893 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 221 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:45,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1166 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-12-21 02:08:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 559. [2023-12-21 02:08:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 460 states have (on average 1.3130434782608695) internal successors, (604), 463 states have internal predecessors, (604), 85 states have call successors, (85), 13 states have call predecessors, (85), 13 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-21 02:08:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 774 transitions. [2023-12-21 02:08:45,932 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 774 transitions. Word has length 170 [2023-12-21 02:08:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:45,932 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 774 transitions. [2023-12-21 02:08:45,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 774 transitions. [2023-12-21 02:08:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:45,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:45,934 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:08:45,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:45,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 718504776, now seen corresponding path program 1 times [2023-12-21 02:08:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371369228] [2023-12-21 02:08:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:46,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371369228] [2023-12-21 02:08:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371369228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:46,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:46,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101836893] [2023-12-21 02:08:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:46,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:46,187 INFO L87 Difference]: Start difference. First operand 559 states and 774 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:46,346 INFO L93 Difference]: Finished difference Result 1189 states and 1661 transitions. [2023-12-21 02:08:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:08:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:46,350 INFO L225 Difference]: With dead ends: 1189 [2023-12-21 02:08:46,350 INFO L226 Difference]: Without dead ends: 871 [2023-12-21 02:08:46,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:08:46,351 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 299 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:46,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 580 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-12-21 02:08:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 618. [2023-12-21 02:08:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 519 states have (on average 1.3082851637764932) internal successors, (679), 522 states have internal predecessors, (679), 85 states have call successors, (85), 13 states have call predecessors, (85), 13 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-21 02:08:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 849 transitions. [2023-12-21 02:08:46,397 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 849 transitions. Word has length 172 [2023-12-21 02:08:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:46,398 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 849 transitions. [2023-12-21 02:08:46,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 849 transitions. [2023-12-21 02:08:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:46,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:46,399 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:08:46,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:46,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 325477766, now seen corresponding path program 1 times [2023-12-21 02:08:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349755866] [2023-12-21 02:08:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:46,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:46,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349755866] [2023-12-21 02:08:46,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349755866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:46,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:46,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:08:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039269236] [2023-12-21 02:08:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:46,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:08:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:46,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:08:46,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:08:46,517 INFO L87 Difference]: Start difference. First operand 618 states and 849 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:46,571 INFO L93 Difference]: Finished difference Result 1263 states and 1759 transitions. [2023-12-21 02:08:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:08:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:46,576 INFO L225 Difference]: With dead ends: 1263 [2023-12-21 02:08:46,576 INFO L226 Difference]: Without dead ends: 773 [2023-12-21 02:08:46,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:46,577 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 45 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:46,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-12-21 02:08:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 633. [2023-12-21 02:08:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 534 states have (on average 1.299625468164794) internal successors, (694), 537 states have internal predecessors, (694), 85 states have call successors, (85), 13 states have call predecessors, (85), 13 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-21 02:08:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 864 transitions. [2023-12-21 02:08:46,617 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 864 transitions. Word has length 172 [2023-12-21 02:08:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:46,618 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 864 transitions. [2023-12-21 02:08:46,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 864 transitions. [2023-12-21 02:08:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:46,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:46,619 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:46,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:08:46,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:46,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -737072056, now seen corresponding path program 1 times [2023-12-21 02:08:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279185863] [2023-12-21 02:08:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279185863] [2023-12-21 02:08:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279185863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:08:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752464571] [2023-12-21 02:08:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:47,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:08:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:08:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:08:47,019 INFO L87 Difference]: Start difference. First operand 633 states and 864 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:47,162 INFO L93 Difference]: Finished difference Result 1061 states and 1428 transitions. [2023-12-21 02:08:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:08:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:47,166 INFO L225 Difference]: With dead ends: 1061 [2023-12-21 02:08:47,166 INFO L226 Difference]: Without dead ends: 1059 [2023-12-21 02:08:47,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:08:47,166 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 96 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:47,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 881 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2023-12-21 02:08:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1054. [2023-12-21 02:08:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 913 states have (on average 1.2880613362541073) internal successors, (1176), 921 states have internal predecessors, (1176), 121 states have call successors, (121), 19 states have call predecessors, (121), 19 states have return successors, (121), 113 states have call predecessors, (121), 121 states have call successors, (121) [2023-12-21 02:08:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1418 transitions. [2023-12-21 02:08:47,223 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1418 transitions. Word has length 172 [2023-12-21 02:08:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:47,223 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1418 transitions. [2023-12-21 02:08:47,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1418 transitions. [2023-12-21 02:08:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:47,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:47,226 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:47,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:08:47,226 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:47,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1108303692, now seen corresponding path program 1 times [2023-12-21 02:08:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226489213] [2023-12-21 02:08:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226489213] [2023-12-21 02:08:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226489213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723591962] [2023-12-21 02:08:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:47,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:47,445 INFO L87 Difference]: Start difference. First operand 1054 states and 1418 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:47,536 INFO L93 Difference]: Finished difference Result 2093 states and 2811 transitions. [2023-12-21 02:08:47,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:08:47,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:47,540 INFO L225 Difference]: With dead ends: 2093 [2023-12-21 02:08:47,540 INFO L226 Difference]: Without dead ends: 1206 [2023-12-21 02:08:47,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:08:47,543 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 152 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:47,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 502 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2023-12-21 02:08:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1082. [2023-12-21 02:08:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 934 states have (on average 1.2751605995717346) internal successors, (1191), 942 states have internal predecessors, (1191), 121 states have call successors, (121), 26 states have call predecessors, (121), 26 states have return successors, (121), 113 states have call predecessors, (121), 121 states have call successors, (121) [2023-12-21 02:08:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1433 transitions. [2023-12-21 02:08:47,606 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1433 transitions. Word has length 172 [2023-12-21 02:08:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:47,606 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1433 transitions. [2023-12-21 02:08:47,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1433 transitions. [2023-12-21 02:08:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:47,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:47,609 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:47,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:08:47,609 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:47,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash 715276682, now seen corresponding path program 1 times [2023-12-21 02:08:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345685769] [2023-12-21 02:08:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345685769] [2023-12-21 02:08:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345685769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:47,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:08:47,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869810394] [2023-12-21 02:08:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:47,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:08:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:47,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:08:47,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:08:47,868 INFO L87 Difference]: Start difference. First operand 1082 states and 1433 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:47,983 INFO L93 Difference]: Finished difference Result 2451 states and 3279 transitions. [2023-12-21 02:08:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:08:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:47,988 INFO L225 Difference]: With dead ends: 2451 [2023-12-21 02:08:47,988 INFO L226 Difference]: Without dead ends: 1540 [2023-12-21 02:08:47,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:08:47,989 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 268 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:47,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 892 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2023-12-21 02:08:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1202. [2023-12-21 02:08:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1054 states have (on average 1.2722960151802656) internal successors, (1341), 1062 states have internal predecessors, (1341), 121 states have call successors, (121), 26 states have call predecessors, (121), 26 states have return successors, (121), 113 states have call predecessors, (121), 121 states have call successors, (121) [2023-12-21 02:08:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1583 transitions. [2023-12-21 02:08:48,056 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1583 transitions. Word has length 172 [2023-12-21 02:08:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:48,058 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1583 transitions. [2023-12-21 02:08:48,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1583 transitions. [2023-12-21 02:08:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:48,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:48,059 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:48,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:08:48,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:48,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash 973442120, now seen corresponding path program 1 times [2023-12-21 02:08:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045453706] [2023-12-21 02:08:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045453706] [2023-12-21 02:08:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045453706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:48,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219942538] [2023-12-21 02:08:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:48,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:48,274 INFO L87 Difference]: Start difference. First operand 1202 states and 1583 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:48,476 INFO L93 Difference]: Finished difference Result 2367 states and 3138 transitions. [2023-12-21 02:08:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:08:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:48,481 INFO L225 Difference]: With dead ends: 2367 [2023-12-21 02:08:48,481 INFO L226 Difference]: Without dead ends: 1366 [2023-12-21 02:08:48,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:08:48,484 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 246 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:48,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 694 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:08:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2023-12-21 02:08:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1162. [2023-12-21 02:08:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1014 states have (on average 1.2613412228796843) internal successors, (1279), 1022 states have internal predecessors, (1279), 121 states have call successors, (121), 26 states have call predecessors, (121), 26 states have return successors, (121), 113 states have call predecessors, (121), 121 states have call successors, (121) [2023-12-21 02:08:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1521 transitions. [2023-12-21 02:08:48,559 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1521 transitions. Word has length 172 [2023-12-21 02:08:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:48,559 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1521 transitions. [2023-12-21 02:08:48,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1521 transitions. [2023-12-21 02:08:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:48,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:48,561 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:08:48,561 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:48,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1165938252, now seen corresponding path program 1 times [2023-12-21 02:08:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184164448] [2023-12-21 02:08:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:48,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184164448] [2023-12-21 02:08:48,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184164448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:48,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217267068] [2023-12-21 02:08:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:48,775 INFO L87 Difference]: Start difference. First operand 1162 states and 1521 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:48,881 INFO L93 Difference]: Finished difference Result 2152 states and 2838 transitions. [2023-12-21 02:08:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:08:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:48,885 INFO L225 Difference]: With dead ends: 2152 [2023-12-21 02:08:48,885 INFO L226 Difference]: Without dead ends: 1386 [2023-12-21 02:08:48,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:08:48,887 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 84 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:48,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 824 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2023-12-21 02:08:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1272. [2023-12-21 02:08:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1112 states have (on average 1.2670863309352518) internal successors, (1409), 1124 states have internal predecessors, (1409), 129 states have call successors, (129), 30 states have call predecessors, (129), 30 states have return successors, (129), 117 states have call predecessors, (129), 129 states have call successors, (129) [2023-12-21 02:08:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1667 transitions. [2023-12-21 02:08:48,971 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1667 transitions. Word has length 172 [2023-12-21 02:08:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:48,972 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1667 transitions. [2023-12-21 02:08:48,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1667 transitions. [2023-12-21 02:08:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:48,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:48,973 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:48,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:08:48,973 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:48,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1227977866, now seen corresponding path program 1 times [2023-12-21 02:08:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:48,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113111064] [2023-12-21 02:08:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:49,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:49,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113111064] [2023-12-21 02:08:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113111064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:08:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093280191] [2023-12-21 02:08:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:49,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:08:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:08:49,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:08:49,207 INFO L87 Difference]: Start difference. First operand 1272 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:49,335 INFO L93 Difference]: Finished difference Result 2872 states and 3755 transitions. [2023-12-21 02:08:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:08:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:49,340 INFO L225 Difference]: With dead ends: 2872 [2023-12-21 02:08:49,340 INFO L226 Difference]: Without dead ends: 1948 [2023-12-21 02:08:49,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:08:49,342 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 170 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:49,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 752 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2023-12-21 02:08:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1326. [2023-12-21 02:08:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1166 states have (on average 1.2547169811320755) internal successors, (1463), 1178 states have internal predecessors, (1463), 129 states have call successors, (129), 30 states have call predecessors, (129), 30 states have return successors, (129), 117 states have call predecessors, (129), 129 states have call successors, (129) [2023-12-21 02:08:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1721 transitions. [2023-12-21 02:08:49,414 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1721 transitions. Word has length 172 [2023-12-21 02:08:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:49,414 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1721 transitions. [2023-12-21 02:08:49,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1721 transitions. [2023-12-21 02:08:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 02:08:49,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:49,415 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:49,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:08:49,415 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:49,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1545505930, now seen corresponding path program 1 times [2023-12-21 02:08:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421700857] [2023-12-21 02:08:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:08:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:08:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:08:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:08:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:08:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:08:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:08:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:08:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:08:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:08:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:08:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:08:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:08:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:08:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 02:08:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 02:08:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 02:08:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 02:08:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 02:08:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-21 02:08:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-21 02:08:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:08:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-21 02:08:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:08:49,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421700857] [2023-12-21 02:08:49,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421700857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:08:49,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:08:49,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:08:49,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657724267] [2023-12-21 02:08:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:08:49,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:08:49,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:08:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:08:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:08:49,716 INFO L87 Difference]: Start difference. First operand 1326 states and 1721 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:08:49,871 INFO L93 Difference]: Finished difference Result 2474 states and 3244 transitions. [2023-12-21 02:08:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:08:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-12-21 02:08:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:08:49,875 INFO L225 Difference]: With dead ends: 2474 [2023-12-21 02:08:49,875 INFO L226 Difference]: Without dead ends: 1562 [2023-12-21 02:08:49,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:08:49,877 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 180 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:08:49,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1023 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:08:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2023-12-21 02:08:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1314. [2023-12-21 02:08:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1154 states have (on average 1.2504332755632583) internal successors, (1443), 1166 states have internal predecessors, (1443), 129 states have call successors, (129), 30 states have call predecessors, (129), 30 states have return successors, (129), 117 states have call predecessors, (129), 129 states have call successors, (129) [2023-12-21 02:08:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1701 transitions. [2023-12-21 02:08:49,949 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1701 transitions. Word has length 172 [2023-12-21 02:08:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:08:49,949 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1701 transitions. [2023-12-21 02:08:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-21 02:08:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1701 transitions. [2023-12-21 02:08:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 02:08:49,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:08:49,950 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:49,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 02:08:49,950 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:08:49,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:08:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -942206312, now seen corresponding path program 1 times [2023-12-21 02:08:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:08:49,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647270218] [2023-12-21 02:08:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:08:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:08:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:08:50,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:08:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:08:50,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:08:50,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:08:50,224 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:08:50,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:08:50,227 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:50,229 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:08:50,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:08:50 BoogieIcfgContainer [2023-12-21 02:08:50,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:08:50,349 INFO L158 Benchmark]: Toolchain (without parser) took 19848.89ms. Allocated memory was 314.6MB in the beginning and 821.0MB in the end (delta: 506.5MB). Free memory was 270.6MB in the beginning and 432.9MB in the end (delta: -162.3MB). Peak memory consumption was 345.0MB. Max. memory is 8.0GB. [2023-12-21 02:08:50,349 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory was 164.9MB in the beginning and 164.8MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:08:50,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.53ms. Allocated memory is still 314.6MB. Free memory was 270.6MB in the beginning and 255.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:08:50,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.96ms. Allocated memory is still 314.6MB. Free memory was 255.6MB in the beginning and 251.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:08:50,350 INFO L158 Benchmark]: Boogie Preprocessor took 73.72ms. Allocated memory is still 314.6MB. Free memory was 251.4MB in the beginning and 244.6MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-21 02:08:50,350 INFO L158 Benchmark]: RCFGBuilder took 774.59ms. Allocated memory is still 314.6MB. Free memory was 244.6MB in the beginning and 198.0MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2023-12-21 02:08:50,350 INFO L158 Benchmark]: TraceAbstraction took 18695.14ms. Allocated memory was 314.6MB in the beginning and 821.0MB in the end (delta: 506.5MB). Free memory was 197.4MB in the beginning and 432.9MB in the end (delta: -235.4MB). Peak memory consumption was 271.6MB. Max. memory is 8.0GB. [2023-12-21 02:08:50,351 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.09ms. Allocated memory is still 212.9MB. Free memory was 164.9MB in the beginning and 164.8MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.53ms. Allocated memory is still 314.6MB. Free memory was 270.6MB in the beginning and 255.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.96ms. Allocated memory is still 314.6MB. Free memory was 255.6MB in the beginning and 251.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.72ms. Allocated memory is still 314.6MB. Free memory was 251.4MB in the beginning and 244.6MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 774.59ms. Allocated memory is still 314.6MB. Free memory was 244.6MB in the beginning and 198.0MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 18695.14ms. Allocated memory was 314.6MB in the beginning and 821.0MB in the end (delta: 506.5MB). Free memory was 197.4MB in the beginning and 432.9MB in the end (delta: -235.4MB). Peak memory consumption was 271.6MB. 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 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L22] signed long int var_1_1 = 1000000; [L23] signed 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 char var_1_3 = 1; [L26] unsigned char var_1_3 = 1; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] signed short int var_1_5 = -64; [L28] signed short int var_1_5 = -64; [L29] signed short int* var_1_5_Pointer = &(var_1_5); [L30] signed short int var_1_6 = -64; [L30] signed short int var_1_6 = -64; [L31] signed short int* var_1_6_Pointer = &(var_1_6); [L32] signed short int var_1_7 = 10; [L32] signed short int var_1_7 = 10; [L33] signed short int* var_1_7_Pointer = &(var_1_7); [L34] signed short int var_1_8 = 8; [L34] signed short int var_1_8 = 8; [L35] signed short int* var_1_8_Pointer = &(var_1_8); [L36] unsigned char var_1_9 = 0; [L36] unsigned char var_1_9 = 0; [L37] unsigned char* var_1_9_Pointer = &(var_1_9); [L38] unsigned char var_1_10 = 1; [L38] unsigned char var_1_10 = 1; [L39] unsigned char* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_11 = 0; [L40] unsigned char var_1_11 = 0; [L41] unsigned char* var_1_11_Pointer = &(var_1_11); [L42] unsigned short int var_1_12 = 2; [L42] unsigned short int var_1_12 = 2; [L43] unsigned short int* var_1_12_Pointer = &(var_1_12); [L44] float var_1_13 = 32.25; [L44] float var_1_13 = 32.25; [L45] float* var_1_13_Pointer = &(var_1_13); [L46] float var_1_14 = 15.5; [L46] float var_1_14 = 15.5; [L47] float* var_1_14_Pointer = &(var_1_14); [L48] float var_1_15 = 256.25; [L48] float var_1_15 = 256.25; [L49] float* var_1_15_Pointer = &(var_1_15); [L50] double var_1_16 = 8.6; [L50] double var_1_16 = 8.6; [L51] double* var_1_16_Pointer = &(var_1_16); [L52] unsigned short int var_1_17 = 57581; [L52] unsigned short int var_1_17 = 57581; [L53] unsigned short int* var_1_17_Pointer = &(var_1_17); [L54] unsigned char last_1_var_1_9 = 0; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR \read(var_1_9) [L118] last_1_var_1_9 = var_1_9 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] var_1_6 = __VERIFIER_nondet_short() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_7 = __VERIFIER_nondet_short() [L93] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] var_1_8 = __VERIFIER_nondet_short() [L96] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] var_1_13 = __VERIFIER_nondet_float() [L105] EXPR \read(var_1_13) [L105] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F [L105] EXPR \read(var_1_13) [L105] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] var_1_14 = __VERIFIER_nondet_float() [L107] EXPR \read(var_1_14) [L107] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L107] EXPR \read(var_1_14) [L107] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] var_1_15 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_15) [L110] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L110] EXPR \read(var_1_15) [L110] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L111] var_1_16 = __VERIFIER_nondet_double() [L112] EXPR \read(var_1_16) [L112] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F [L112] EXPR \read(var_1_16) [L112] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] var_1_17 = __VERIFIER_nondet_ushort() [L114] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L129] RET updateVariables() [L130] CALL step() [L58] COND FALSE !(\read(last_1_var_1_9)) [L61] EXPR \read(*var_1_7_Pointer) [L61] EXPR \read(*var_1_8_Pointer) [L61] (*(var_1_5_Pointer)) = (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR \read(*var_1_14_Pointer) [L63] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] COND TRUE ((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer)) [L64] EXPR \read(*var_1_16_Pointer) [L64] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L64] COND TRUE ((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer)) [L65] EXPR \read(*var_1_17_Pointer) [L65] EXPR \read(*var_1_7_Pointer) [L65] (*(var_1_12_Pointer)) = ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))) [L72] EXPR \read(*var_1_5_Pointer) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) [L72] EXPR \read(*var_1_2_Pointer) [L72] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) [L72] EXPR \read(*var_1_3_Pointer) [L72] (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] COND TRUE (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) [L73] EXPR \read(*var_1_10_Pointer) [L73] (*(var_1_9_Pointer)) = (! (*(var_1_10_Pointer))) [L77] EXPR \read(*var_1_9_Pointer) [L77] unsigned char stepLocal_0 = (*(var_1_9_Pointer)); [L78] stepLocal_0 && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] stepLocal_0 && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] COND FALSE !(stepLocal_0 && (*(var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*var_1_9_Pointer) [L121] EXPR (*(var_1_9_Pointer)) && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (*(var_1_9_Pointer)) && (*(var_1_9_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1 [L121] EXPR ((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))) [L121] EXPR \read(*var_1_5_Pointer) [L121] EXPR \read(*var_1_7_Pointer) [L121] EXPR \read(*var_1_8_Pointer) [L121] EXPR last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer))))))) [L121] EXPR \read(*var_1_5_Pointer) [L121] EXPR \read(*var_1_12_Pointer) [L121] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) [L121] EXPR \read(*var_1_2_Pointer) [L121] EXPR ((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) [L121] EXPR \read(*var_1_3_Pointer) [L121] EXPR (((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))) [L121] EXPR \read(*var_1_9_Pointer) [L121] EXPR \read(*var_1_10_Pointer) [L121] EXPR ((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR ((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) [L121] EXPR \read(*var_1_13_Pointer) [L121] EXPR \read(*var_1_14_Pointer) [L121] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer)))) [L121] EXPR \read(*var_1_12_Pointer) [L121] EXPR \read(*var_1_8_Pointer) [L121] EXPR (((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121] EXPR (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) VAL [isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L121-L122] return (((((*(var_1_9_Pointer)) && (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_5_Pointer)))) : 1) && (last_1_var_1_9 ? ((*(var_1_5_Pointer)) == ((signed short int) (*(var_1_6_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed short int) (((*(var_1_7_Pointer)) + 16) - (*(var_1_8_Pointer))))))) && (((((*(var_1_5_Pointer)) >= (*(var_1_12_Pointer))) && (*(var_1_2_Pointer))) && (*(var_1_3_Pointer))) ? ((*(var_1_9_Pointer)) == ((unsigned char) (! (*(var_1_10_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned char) (! ((*(var_1_11_Pointer)) || (*(var_1_10_Pointer)))))))) && ((((*(var_1_13_Pointer)) / (*(var_1_14_Pointer))) <= (*(var_1_15_Pointer))) ? ((((*(var_1_16_Pointer)) - 2.3) > (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_17_Pointer)) - (*(var_1_7_Pointer))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (((((*(var_1_7_Pointer))) > ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))) ? ((*(var_1_7_Pointer))) : ((((((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))) : ((*(var_1_17_Pointer)) - (*(var_1_8_Pointer))))))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_8_Pointer))))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_9=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5486 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5486 mSDsluCounter, 14343 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10732 mSDsCounter, 936 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2256 IncrementalHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 936 mSolverCounterUnsat, 3611 mSDtfsCounter, 2256 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1613 GetRequests, 1427 SyntacticMatches, 2 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1326occurred in iteration=17, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 2559 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 3529 NumberOfCodeBlocks, 3529 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3664 ConstructedInterpolants, 146 QuantifiedInterpolants, 20539 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1408 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 17428/18480 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 02:08:50,366 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...