/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/double_req_bl_0220a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 11:56:03,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 11:56:03,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 11:56:03,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 11:56:03,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 11:56:03,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 11:56:03,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 11:56:03,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 11:56:03,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 11:56:03,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 11:56:03,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 11:56:03,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 11:56:03,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 11:56:03,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 11:56:03,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 11:56:03,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 11:56:03,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 11:56:03,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 11:56:03,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 11:56:03,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 11:56:03,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 11:56:03,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 11:56:03,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 11:56:03,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 11:56:03,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 11:56:03,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 11:56:03,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 11:56:03,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 11:56:03,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 11:56:03,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 11:56:03,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 11:56:03,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 11:56:03,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 11:56:03,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 11:56:03,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 11:56:03,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 11:56:03,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 11:56:03,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 11:56:03,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 11:56:03,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 11:56:03,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 11:56:03,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 11:56:03,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 11:56:03,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 11:56:03,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 11:56:03,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 11:56:03,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 11:56:03,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 11:56:03,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 11:56:03,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 11:56:03,799 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 11:56:03,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 11:56:03,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 11:56:03,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 11:56:03,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 11:56:03,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 11:56:03,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 11:56:03,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 11:56:03,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 11:56:03,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 11:56:03,801 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 11:56:03,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 11:56:03,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 11:56:03,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 11:56:03,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 11:56:03,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 11:56:03,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 11:56:03,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 11:56:03,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:56:03,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 11:56:03,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 11:56:03,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 11:56:03,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 11:56:03,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 11:56:03,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 11:56:03,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-16 11:56:04,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 11:56:04,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 11:56:04,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 11:56:04,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 11:56:04,184 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 11:56:04,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0220a.c [2022-10-16 11:56:04,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063fca58e/1b61988f892c45b091e2d7132e06b72c/FLAG80eb27377 [2022-10-16 11:56:04,889 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 11:56:04,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0220a.c [2022-10-16 11:56:04,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063fca58e/1b61988f892c45b091e2d7132e06b72c/FLAG80eb27377 [2022-10-16 11:56:05,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063fca58e/1b61988f892c45b091e2d7132e06b72c [2022-10-16 11:56:05,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 11:56:05,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 11:56:05,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 11:56:05,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 11:56:05,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 11:56:05,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:05,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70249328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05, skipping insertion in model container [2022-10-16 11:56:05,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:05,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 11:56:05,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 11:56:05,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0220a.c[16452,16465] [2022-10-16 11:56:05,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:56:05,739 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 11:56:05,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0220a.c[16452,16465] [2022-10-16 11:56:05,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:56:05,925 INFO L208 MainTranslator]: Completed translation [2022-10-16 11:56:05,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05 WrapperNode [2022-10-16 11:56:05,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 11:56:05,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 11:56:05,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 11:56:05,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 11:56:05,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:05,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,134 INFO L138 Inliner]: procedures = 25, calls = 379, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1246 [2022-10-16 11:56:06,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 11:56:06,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 11:56:06,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 11:56:06,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 11:56:06,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 11:56:06,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 11:56:06,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 11:56:06,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 11:56:06,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (1/1) ... [2022-10-16 11:56:06,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:56:06,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:56:06,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 11:56:06,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 11:56:06,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 11:56:06,433 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2022-10-16 11:56:06,434 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2022-10-16 11:56:06,434 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_cos [2022-10-16 11:56:06,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_cos [2022-10-16 11:56:06,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 11:56:06,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 11:56:06,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 11:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 11:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 11:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 11:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_sin [2022-10-16 11:56:06,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_sin [2022-10-16 11:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2022-10-16 11:56:06,436 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2022-10-16 11:56:06,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 11:56:06,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 11:56:06,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 11:56:06,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 11:56:06,641 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 11:56:06,647 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 11:56:08,486 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 11:56:08,500 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 11:56:08,501 INFO L300 CfgBuilder]: Removed 65 assume(true) statements. [2022-10-16 11:56:08,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:56:08 BoogieIcfgContainer [2022-10-16 11:56:08,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 11:56:08,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 11:56:08,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 11:56:08,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 11:56:08,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:56:05" (1/3) ... [2022-10-16 11:56:08,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf69ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:56:08, skipping insertion in model container [2022-10-16 11:56:08,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:56:05" (2/3) ... [2022-10-16 11:56:08,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf69ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:56:08, skipping insertion in model container [2022-10-16 11:56:08,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:56:08" (3/3) ... [2022-10-16 11:56:08,515 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0220a.c [2022-10-16 11:56:08,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 11:56:08,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 188 error locations. [2022-10-16 11:56:08,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 11:56:08,650 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@301fb9a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 11:56:08,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 188 error locations. [2022-10-16 11:56:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 631 states, 426 states have (on average 1.8333333333333333) internal successors, (781), 614 states have internal predecessors, (781), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-10-16 11:56:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 11:56:08,670 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:08,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:08,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1639959832, now seen corresponding path program 1 times [2022-10-16 11:56:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:08,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680548179] [2022-10-16 11:56:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:09,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680548179] [2022-10-16 11:56:09,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680548179] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:09,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:09,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:56:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954992056] [2022-10-16 11:56:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:09,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 11:56:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 11:56:09,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 11:56:09,075 INFO L87 Difference]: Start difference. First operand has 631 states, 426 states have (on average 1.8333333333333333) internal successors, (781), 614 states have internal predecessors, (781), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:09,183 INFO L93 Difference]: Finished difference Result 1260 states and 1620 transitions. [2022-10-16 11:56:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 11:56:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 11:56:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:09,220 INFO L225 Difference]: With dead ends: 1260 [2022-10-16 11:56:09,221 INFO L226 Difference]: Without dead ends: 598 [2022-10-16 11:56:09,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 11:56:09,235 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:09,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:56:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-10-16 11:56:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-10-16 11:56:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 399 states have (on average 1.68671679197995) internal successors, (673), 587 states have internal predecessors, (673), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 689 transitions. [2022-10-16 11:56:09,327 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 689 transitions. Word has length 15 [2022-10-16 11:56:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:09,327 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 689 transitions. [2022-10-16 11:56:09,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 689 transitions. [2022-10-16 11:56:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 11:56:09,329 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:09,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:09,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 11:56:09,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash -128939936, now seen corresponding path program 1 times [2022-10-16 11:56:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352057445] [2022-10-16 11:56:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352057445] [2022-10-16 11:56:09,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352057445] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:09,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:09,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:56:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630188967] [2022-10-16 11:56:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:56:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:56:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:56:09,706 INFO L87 Difference]: Start difference. First operand 598 states and 689 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:09,796 INFO L93 Difference]: Finished difference Result 1190 states and 1371 transitions. [2022-10-16 11:56:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:56:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 11:56:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:09,855 INFO L225 Difference]: With dead ends: 1190 [2022-10-16 11:56:09,856 INFO L226 Difference]: Without dead ends: 606 [2022-10-16 11:56:09,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:56:09,869 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 7 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:09,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1351 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:56:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-10-16 11:56:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 599. [2022-10-16 11:56:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 400 states have (on average 1.685) internal successors, (674), 588 states have internal predecessors, (674), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 690 transitions. [2022-10-16 11:56:09,932 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 690 transitions. Word has length 19 [2022-10-16 11:56:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:09,933 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 690 transitions. [2022-10-16 11:56:09,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 690 transitions. [2022-10-16 11:56:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 11:56:09,936 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:09,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:09,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 11:56:09,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1684595914, now seen corresponding path program 1 times [2022-10-16 11:56:09,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:09,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123318146] [2022-10-16 11:56:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123318146] [2022-10-16 11:56:10,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123318146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:10,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:10,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 11:56:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518850887] [2022-10-16 11:56:10,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:56:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:56:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:56:10,173 INFO L87 Difference]: Start difference. First operand 599 states and 690 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:10,251 INFO L93 Difference]: Finished difference Result 606 states and 698 transitions. [2022-10-16 11:56:10,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:56:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 11:56:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:10,256 INFO L225 Difference]: With dead ends: 606 [2022-10-16 11:56:10,256 INFO L226 Difference]: Without dead ends: 605 [2022-10-16 11:56:10,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:56:10,259 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 571 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:10,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 778 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:56:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-10-16 11:56:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 598. [2022-10-16 11:56:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 400 states have (on average 1.6825) internal successors, (673), 587 states have internal predecessors, (673), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 689 transitions. [2022-10-16 11:56:10,282 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 689 transitions. Word has length 22 [2022-10-16 11:56:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:10,282 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 689 transitions. [2022-10-16 11:56:10,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 689 transitions. [2022-10-16 11:56:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 11:56:10,284 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:10,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:10,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 11:56:10,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -682865335, now seen corresponding path program 1 times [2022-10-16 11:56:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:10,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408020774] [2022-10-16 11:56:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:10,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408020774] [2022-10-16 11:56:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408020774] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:10,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:10,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:56:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540166889] [2022-10-16 11:56:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:56:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:56:10,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:56:10,408 INFO L87 Difference]: Start difference. First operand 598 states and 689 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:10,485 INFO L93 Difference]: Finished difference Result 605 states and 697 transitions. [2022-10-16 11:56:10,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:56:10,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 11:56:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:10,490 INFO L225 Difference]: With dead ends: 605 [2022-10-16 11:56:10,490 INFO L226 Difference]: Without dead ends: 604 [2022-10-16 11:56:10,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:56:10,492 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 536 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:10,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 965 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:56:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-10-16 11:56:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 597. [2022-10-16 11:56:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 400 states have (on average 1.68) internal successors, (672), 586 states have internal predecessors, (672), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 688 transitions. [2022-10-16 11:56:10,516 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 688 transitions. Word has length 23 [2022-10-16 11:56:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:10,516 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 688 transitions. [2022-10-16 11:56:10,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 688 transitions. [2022-10-16 11:56:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 11:56:10,518 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:10,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:10,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 11:56:10,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __kernel_cosErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash -891972916, now seen corresponding path program 1 times [2022-10-16 11:56:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:10,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450926092] [2022-10-16 11:56:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:10,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450926092] [2022-10-16 11:56:10,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450926092] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:10,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:10,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:56:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494578229] [2022-10-16 11:56:10,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:10,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:56:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:10,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:56:10,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:56:10,745 INFO L87 Difference]: Start difference. First operand 597 states and 688 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:10,797 INFO L93 Difference]: Finished difference Result 618 states and 710 transitions. [2022-10-16 11:56:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 11:56:10,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 11:56:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:10,802 INFO L225 Difference]: With dead ends: 618 [2022-10-16 11:56:10,802 INFO L226 Difference]: Without dead ends: 596 [2022-10-16 11:56:10,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:56:10,804 INFO L413 NwaCegarLoop]: 685 mSDtfsCounter, 2 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:10,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2041 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:56:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-10-16 11:56:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-10-16 11:56:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 399 states have (on average 1.6741854636591478) internal successors, (668), 585 states have internal predecessors, (668), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 684 transitions. [2022-10-16 11:56:10,826 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 684 transitions. Word has length 25 [2022-10-16 11:56:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:10,827 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 684 transitions. [2022-10-16 11:56:10,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 684 transitions. [2022-10-16 11:56:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 11:56:10,828 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:10,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:10,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 11:56:10,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1764093174, now seen corresponding path program 1 times [2022-10-16 11:56:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:10,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87648449] [2022-10-16 11:56:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:10,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:10,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87648449] [2022-10-16 11:56:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87648449] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:56:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399072270] [2022-10-16 11:56:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:10,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:56:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:56:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:56:10,975 INFO L87 Difference]: Start difference. First operand 596 states and 684 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:11,041 INFO L93 Difference]: Finished difference Result 617 states and 711 transitions. [2022-10-16 11:56:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:56:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 11:56:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:11,046 INFO L225 Difference]: With dead ends: 617 [2022-10-16 11:56:11,046 INFO L226 Difference]: Without dead ends: 615 [2022-10-16 11:56:11,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:56:11,048 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 28 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:11,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2022 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:56:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-10-16 11:56:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 608. [2022-10-16 11:56:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 412 states have (on average 1.662621359223301) internal successors, (685), 597 states have internal predecessors, (685), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 701 transitions. [2022-10-16 11:56:11,070 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 701 transitions. Word has length 24 [2022-10-16 11:56:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:11,071 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 701 transitions. [2022-10-16 11:56:11,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 701 transitions. [2022-10-16 11:56:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 11:56:11,072 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:11,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:11,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 11:56:11,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash 896423787, now seen corresponding path program 1 times [2022-10-16 11:56:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:11,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978562736] [2022-10-16 11:56:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:56:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:56:11,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:56:11,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978562736] [2022-10-16 11:56:11,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978562736] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:56:11,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:56:11,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:56:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038296294] [2022-10-16 11:56:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:56:11,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:56:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:56:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:56:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:56:11,216 INFO L87 Difference]: Start difference. First operand 608 states and 701 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:56:11,306 INFO L93 Difference]: Finished difference Result 615 states and 709 transitions. [2022-10-16 11:56:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:56:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 11:56:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:56:11,311 INFO L225 Difference]: With dead ends: 615 [2022-10-16 11:56:11,311 INFO L226 Difference]: Without dead ends: 614 [2022-10-16 11:56:11,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:56:11,312 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 1092 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:56:11,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 924 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:56:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-10-16 11:56:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 607. [2022-10-16 11:56:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 412 states have (on average 1.6601941747572815) internal successors, (684), 596 states have internal predecessors, (684), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 11:56:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2022-10-16 11:56:11,336 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 25 [2022-10-16 11:56:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:56:11,336 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2022-10-16 11:56:11,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:56:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2022-10-16 11:56:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 11:56:11,337 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:56:11,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:11,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 11:56:11,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 185 more)] === [2022-10-16 11:56:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:56:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1147686097, now seen corresponding path program 1 times [2022-10-16 11:56:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:56:11,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122016128] [2022-10-16 11:56:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:56:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:56:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 11:56:11,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 11:56:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 11:56:11,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 11:56:11,575 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 11:56:11,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (187 of 188 remaining) [2022-10-16 11:56:11,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (186 of 188 remaining) [2022-10-16 11:56:11,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (185 of 188 remaining) [2022-10-16 11:56:11,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (184 of 188 remaining) [2022-10-16 11:56:11,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (183 of 188 remaining) [2022-10-16 11:56:11,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (182 of 188 remaining) [2022-10-16 11:56:11,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (181 of 188 remaining) [2022-10-16 11:56:11,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (180 of 188 remaining) [2022-10-16 11:56:11,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 188 remaining) [2022-10-16 11:56:11,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 188 remaining) [2022-10-16 11:56:11,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 188 remaining) [2022-10-16 11:56:11,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_cosErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 188 remaining) [2022-10-16 11:56:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_cosErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 188 remaining) [2022-10-16 11:56:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 188 remaining) [2022-10-16 11:56:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 188 remaining) [2022-10-16 11:56:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 188 remaining) [2022-10-16 11:56:11,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 188 remaining) [2022-10-16 11:56:11,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 188 remaining) [2022-10-16 11:56:11,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 188 remaining) [2022-10-16 11:56:11,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 188 remaining) [2022-10-16 11:56:11,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 188 remaining) [2022-10-16 11:56:11,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 188 remaining) [2022-10-16 11:56:11,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 188 remaining) [2022-10-16 11:56:11,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 188 remaining) [2022-10-16 11:56:11,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 188 remaining) [2022-10-16 11:56:11,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 188 remaining) [2022-10-16 11:56:11,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 188 remaining) [2022-10-16 11:56:11,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 188 remaining) [2022-10-16 11:56:11,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 188 remaining) [2022-10-16 11:56:11,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 188 remaining) [2022-10-16 11:56:11,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 188 remaining) [2022-10-16 11:56:11,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 188 remaining) [2022-10-16 11:56:11,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 188 remaining) [2022-10-16 11:56:11,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 188 remaining) [2022-10-16 11:56:11,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 188 remaining) [2022-10-16 11:56:11,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 188 remaining) [2022-10-16 11:56:11,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 188 remaining) [2022-10-16 11:56:11,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 188 remaining) [2022-10-16 11:56:11,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 188 remaining) [2022-10-16 11:56:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 188 remaining) [2022-10-16 11:56:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 188 remaining) [2022-10-16 11:56:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 188 remaining) [2022-10-16 11:56:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 188 remaining) [2022-10-16 11:56:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 188 remaining) [2022-10-16 11:56:11,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 188 remaining) [2022-10-16 11:56:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 188 remaining) [2022-10-16 11:56:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 188 remaining) [2022-10-16 11:56:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 188 remaining) [2022-10-16 11:56:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 188 remaining) [2022-10-16 11:56:11,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 188 remaining) [2022-10-16 11:56:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 188 remaining) [2022-10-16 11:56:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 188 remaining) [2022-10-16 11:56:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 188 remaining) [2022-10-16 11:56:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 188 remaining) [2022-10-16 11:56:11,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 188 remaining) [2022-10-16 11:56:11,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 188 remaining) [2022-10-16 11:56:11,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 188 remaining) [2022-10-16 11:56:11,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 188 remaining) [2022-10-16 11:56:11,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 188 remaining) [2022-10-16 11:56:11,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 188 remaining) [2022-10-16 11:56:11,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 188 remaining) [2022-10-16 11:56:11,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 188 remaining) [2022-10-16 11:56:11,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 188 remaining) [2022-10-16 11:56:11,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 188 remaining) [2022-10-16 11:56:11,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 188 remaining) [2022-10-16 11:56:11,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 188 remaining) [2022-10-16 11:56:11,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 188 remaining) [2022-10-16 11:56:11,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 188 remaining) [2022-10-16 11:56:11,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 188 remaining) [2022-10-16 11:56:11,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 188 remaining) [2022-10-16 11:56:11,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 188 remaining) [2022-10-16 11:56:11,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 188 remaining) [2022-10-16 11:56:11,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 188 remaining) [2022-10-16 11:56:11,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 188 remaining) [2022-10-16 11:56:11,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 188 remaining) [2022-10-16 11:56:11,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 188 remaining) [2022-10-16 11:56:11,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 188 remaining) [2022-10-16 11:56:11,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 188 remaining) [2022-10-16 11:56:11,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 188 remaining) [2022-10-16 11:56:11,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 188 remaining) [2022-10-16 11:56:11,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 188 remaining) [2022-10-16 11:56:11,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 188 remaining) [2022-10-16 11:56:11,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 188 remaining) [2022-10-16 11:56:11,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 188 remaining) [2022-10-16 11:56:11,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 188 remaining) [2022-10-16 11:56:11,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 188 remaining) [2022-10-16 11:56:11,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 188 remaining) [2022-10-16 11:56:11,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 188 remaining) [2022-10-16 11:56:11,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 188 remaining) [2022-10-16 11:56:11,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 188 remaining) [2022-10-16 11:56:11,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 188 remaining) [2022-10-16 11:56:11,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 188 remaining) [2022-10-16 11:56:11,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 188 remaining) [2022-10-16 11:56:11,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 188 remaining) [2022-10-16 11:56:11,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 188 remaining) [2022-10-16 11:56:11,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 188 remaining) [2022-10-16 11:56:11,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 188 remaining) [2022-10-16 11:56:11,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 188 remaining) [2022-10-16 11:56:11,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 188 remaining) [2022-10-16 11:56:11,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 188 remaining) [2022-10-16 11:56:11,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 188 remaining) [2022-10-16 11:56:11,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 188 remaining) [2022-10-16 11:56:11,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 188 remaining) [2022-10-16 11:56:11,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 188 remaining) [2022-10-16 11:56:11,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 188 remaining) [2022-10-16 11:56:11,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 188 remaining) [2022-10-16 11:56:11,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 188 remaining) [2022-10-16 11:56:11,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 188 remaining) [2022-10-16 11:56:11,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 188 remaining) [2022-10-16 11:56:11,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 188 remaining) [2022-10-16 11:56:11,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 188 remaining) [2022-10-16 11:56:11,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 188 remaining) [2022-10-16 11:56:11,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 188 remaining) [2022-10-16 11:56:11,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 188 remaining) [2022-10-16 11:56:11,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 188 remaining) [2022-10-16 11:56:11,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 188 remaining) [2022-10-16 11:56:11,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 188 remaining) [2022-10-16 11:56:11,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 188 remaining) [2022-10-16 11:56:11,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 188 remaining) [2022-10-16 11:56:11,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 188 remaining) [2022-10-16 11:56:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 188 remaining) [2022-10-16 11:56:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 188 remaining) [2022-10-16 11:56:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 188 remaining) [2022-10-16 11:56:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 188 remaining) [2022-10-16 11:56:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 188 remaining) [2022-10-16 11:56:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 188 remaining) [2022-10-16 11:56:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 188 remaining) [2022-10-16 11:56:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 188 remaining) [2022-10-16 11:56:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 188 remaining) [2022-10-16 11:56:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 188 remaining) [2022-10-16 11:56:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 188 remaining) [2022-10-16 11:56:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 188 remaining) [2022-10-16 11:56:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 188 remaining) [2022-10-16 11:56:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 188 remaining) [2022-10-16 11:56:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 188 remaining) [2022-10-16 11:56:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 188 remaining) [2022-10-16 11:56:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 188 remaining) [2022-10-16 11:56:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 188 remaining) [2022-10-16 11:56:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 188 remaining) [2022-10-16 11:56:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 188 remaining) [2022-10-16 11:56:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 188 remaining) [2022-10-16 11:56:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 188 remaining) [2022-10-16 11:56:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 188 remaining) [2022-10-16 11:56:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 188 remaining) [2022-10-16 11:56:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 188 remaining) [2022-10-16 11:56:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 188 remaining) [2022-10-16 11:56:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 188 remaining) [2022-10-16 11:56:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 188 remaining) [2022-10-16 11:56:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 188 remaining) [2022-10-16 11:56:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 188 remaining) [2022-10-16 11:56:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 188 remaining) [2022-10-16 11:56:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 188 remaining) [2022-10-16 11:56:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 188 remaining) [2022-10-16 11:56:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 188 remaining) [2022-10-16 11:56:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 188 remaining) [2022-10-16 11:56:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 188 remaining) [2022-10-16 11:56:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 188 remaining) [2022-10-16 11:56:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 188 remaining) [2022-10-16 11:56:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 188 remaining) [2022-10-16 11:56:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 188 remaining) [2022-10-16 11:56:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 188 remaining) [2022-10-16 11:56:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 188 remaining) [2022-10-16 11:56:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 188 remaining) [2022-10-16 11:56:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 188 remaining) [2022-10-16 11:56:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 188 remaining) [2022-10-16 11:56:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 188 remaining) [2022-10-16 11:56:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 188 remaining) [2022-10-16 11:56:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 188 remaining) [2022-10-16 11:56:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 188 remaining) [2022-10-16 11:56:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 188 remaining) [2022-10-16 11:56:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 188 remaining) [2022-10-16 11:56:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 188 remaining) [2022-10-16 11:56:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 188 remaining) [2022-10-16 11:56:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 188 remaining) [2022-10-16 11:56:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 188 remaining) [2022-10-16 11:56:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 188 remaining) [2022-10-16 11:56:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 188 remaining) [2022-10-16 11:56:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 188 remaining) [2022-10-16 11:56:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 188 remaining) [2022-10-16 11:56:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 188 remaining) [2022-10-16 11:56:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 188 remaining) [2022-10-16 11:56:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 188 remaining) [2022-10-16 11:56:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 188 remaining) [2022-10-16 11:56:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 188 remaining) [2022-10-16 11:56:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 188 remaining) [2022-10-16 11:56:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 188 remaining) [2022-10-16 11:56:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 188 remaining) [2022-10-16 11:56:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 188 remaining) [2022-10-16 11:56:11,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 11:56:11,643 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:56:11,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 11:56:11,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:56:11 BoogieIcfgContainer [2022-10-16 11:56:11,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 11:56:11,771 INFO L158 Benchmark]: Toolchain (without parser) took 6585.68ms. Allocated memory was 164.6MB in the beginning and 211.8MB in the end (delta: 47.2MB). Free memory was 137.0MB in the beginning and 128.2MB in the end (delta: 8.7MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2022-10-16 11:56:11,771 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 164.6MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 11:56:11,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.38ms. Allocated memory is still 164.6MB. Free memory was 136.8MB in the beginning and 110.9MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-10-16 11:56:11,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 203.64ms. Allocated memory is still 164.6MB. Free memory was 110.8MB in the beginning and 138.9MB in the end (delta: -28.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-16 11:56:11,772 INFO L158 Benchmark]: Boogie Preprocessor took 187.81ms. Allocated memory is still 164.6MB. Free memory was 138.9MB in the beginning and 131.6MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-10-16 11:56:11,773 INFO L158 Benchmark]: RCFGBuilder took 2179.93ms. Allocated memory was 164.6MB in the beginning and 211.8MB in the end (delta: 47.2MB). Free memory was 131.6MB in the beginning and 161.6MB in the end (delta: -30.0MB). Peak memory consumption was 88.5MB. Max. memory is 8.0GB. [2022-10-16 11:56:11,773 INFO L158 Benchmark]: TraceAbstraction took 3263.06ms. Allocated memory is still 211.8MB. Free memory was 160.5MB in the beginning and 128.2MB in the end (delta: 32.3MB). Peak memory consumption was 32.3MB. Max. memory is 8.0GB. [2022-10-16 11:56:11,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 164.6MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 737.38ms. Allocated memory is still 164.6MB. Free memory was 136.8MB in the beginning and 110.9MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 203.64ms. Allocated memory is still 164.6MB. Free memory was 110.8MB in the beginning and 138.9MB in the end (delta: -28.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 187.81ms. Allocated memory is still 164.6MB. Free memory was 138.9MB in the beginning and 131.6MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2179.93ms. Allocated memory was 164.6MB in the beginning and 211.8MB in the end (delta: 47.2MB). Free memory was 131.6MB in the beginning and 161.6MB in the end (delta: -30.0MB). Peak memory consumption was 88.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3263.06ms. Allocated memory is still 211.8MB. Free memory was 160.5MB in the beginning and 128.2MB in the end (delta: 32.3MB). Peak memory consumption was 32.3MB. 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: 458]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of to_int at line 454, overapproximation of someUnaryDOUBLEoperation at line 542, overapproximation of bitwiseAnd at line 184, overapproximation of someBinaryArithmeticDOUBLEoperation at line 456, overapproximation of to_real at line 455. Possible FailurePath: [L22] static const double huge_floor = 1.0e300; [L119-L121] static const double two54_scalbn = 1.80143985094819840000e+16, twom54_scalbn = 5.55111512312578270212e-17, huge_scalbn = 1.0e+300, tiny_scalbn = 1.0e-300; [L190] static const int init_jk_krempio[] = {2, 3, 4, 6}; [L192-L197] static const double PIo2_krempio[] = { 1.57079625129699707031e+00, 7.54978941586159635335e-08, 5.39030252995776476554e-15, 3.28200341580791294123e-22, 1.27065575308067607349e-29, 1.22933308981111328932e-36, 2.73370053816464559624e-44, 2.16741683877804819444e-51, }; [L199-L201] static const double zero_krempio = 0.0, one_krempio = 1.0, two24_krempio = 1.67772160000000000000e+07, twon24_krempio = 5.96046447753906250000e-08; [L376-L387] static const __int32_t two_over_pi_rempio[] = { 0xA2F983, 0x6E4E44, 0x1529FC, 0x2757D1, 0xF534DD, 0xC0DB62, 0x95993C, 0x439041, 0xFE5163, 0xABDEBB, 0xC561B7, 0x246E3A, 0x424DD2, 0xE00649, 0x2EEA09, 0xD1921C, 0xFE1DEB, 0x1CB129, 0xA73EE8, 0x8235F5, 0x2EBB44, 0x84E99C, 0x7026B4, 0x5F7E41, 0x3991D6, 0x398353, 0x39F49C, 0x845F8B, 0xBDF928, 0x3B1FF8, 0x97FFDE, 0x05980F, 0xEF2F11, 0x8B5A0A, 0x6D1F6D, 0x367ECF, 0x27CB09, 0xB74F46, 0x3F669E, 0x5FEA2D, 0x7527BA, 0xC7EBE5, 0xF17B3D, 0x0739F7, 0x8A5292, 0xEA6BFB, 0x5FB11F, 0x8D5D08, 0x560330, 0x46FC7B, 0x6BABF0, 0xCFBC20, 0x9AF436, 0x1DA9E3, 0x91615E, 0xE61B08, 0x659985, 0x5F14A0, 0x68408D, 0xFFD880, 0x4D7327, 0x310606, 0x1556CA, 0x73A8C9, 0x60E27B, 0xC08C6B, }; [L389-L396] static const __int32_t npio2_hw_rempio[] = { 0x3FF921FB, 0x400921FB, 0x4012D97C, 0x401921FB, 0x401F6A7A, 0x4022D97C, 0x4025FDBB, 0x402921FB, 0x402C463A, 0x402F6A7A, 0x4031475C, 0x4032D97C, 0x40346B9C, 0x4035FDBB, 0x40378FDB, 0x403921FB, 0x403AB41B, 0x403C463A, 0x403DD85A, 0x403F6A7A, 0x40407E4C, 0x4041475C, 0x4042106C, 0x4042D97C, 0x4043A28C, 0x40446B9C, 0x404534AC, 0x4045FDBB, 0x4046C6CB, 0x40478FDB, 0x404858EB, 0x404921FB, }; [L398-L407] static const double zero_rempio = 0.00000000000000000000e+00, half_rempio = 5.00000000000000000000e-01, two24_rempio = 1.67772160000000000000e+07, invpio2_rempio = 6.36619772367581382433e-01, pio2_1_rempio = 1.57079632673412561417e+00, pio2_1t_rempio = 6.07710050650619224932e-11, pio2_2_rempio = 6.07710050630396597660e-11, pio2_2t_rempio = 2.02226624879595063154e-21, pio2_3_rempio = 2.02226624871116645580e-21, pio2_3t_rempio = 8.47842766036889956997e-32; [L540-L546] static const double one_kcos = 1.00000000000000000000e+00, C1_kcos = 4.16666666666666019037e-02, C2_kcos = -1.38888888888741095749e-03, C3_kcos = 2.48015872894767294178e-05, C4_kcos = -2.75573143513906633035e-07, C5_kcos = 2.08757232129817482790e-09, C6_kcos = -1.13596475577881948265e-11; [L584-L590] static const double half_ksin = 5.00000000000000000000e-01, S1_ksin = -1.66666666666666324348e-01, S2_ksin = 8.33333333332248946124e-03, S3_ksin = -1.98412698298579493134e-04, S4_ksin = 2.75573137070700676789e-06, S5_ksin = -2.50507602534068634195e-08, S6_ksin = 1.58969099521155010221e-10; VAL [C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, zero_krempio=0, zero_rempio=0] [L650] double x = 0.0; [L651] CALL sin_double(x) [L615] double y[2], z = 0.0; [L616] __int32_t n, ix; VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=0, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L618] ieee_double_shape_type gh_u; [L619] gh_u.value = (x) [L620] EXPR gh_u.parts.msw [L620] (ix) = gh_u.parts.msw [L622] ix &= 0x7fffffff VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix=1072243196, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=0, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L623] COND FALSE !(ix <= 0x3fe921fb) VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix=1072243196, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=0, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L625] COND FALSE !(ix >= 0x7ff00000) [L628] CALL __ieee754_rem_pio2(x, y) [L410] double z = 0.0, w, t, r, fn; [L411] double tx[3]; [L412] __int32_t i, j, n, ix, hx; [L413] int e0, nx; [L414] __uint32_t low; VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, tx={13:0}, x=0, y={10:0}, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L417] ieee_double_shape_type gh_u; [L418] gh_u.value = (x) [L419] EXPR gh_u.parts.msw [L419] (hx) = gh_u.parts.msw [L421] ix = hx & 0x7fffffff VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2147483647, i=1073928572, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, tx={13:0}, x=0, y={10:0}, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L422] COND FALSE !(ix <= 0x3fe921fb) VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2147483647, i=1073928572, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, tx={13:0}, x=0, y={10:0}, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L427] COND FALSE !(ix < 0x4002d97c) VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2147483647, i=1073928572, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, tx={13:0}, x=0, y={10:0}, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L452] COND TRUE ix <= 0x413921fb [L453] CALL, EXPR fabs_double(x) [L175] __uint32_t high; VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=0, zero_krempio=0, zero_rempio=0] [L177] ieee_double_shape_type gh_u; [L178] gh_u.value = (x) [L179] EXPR gh_u.parts.msw [L179] (high) = gh_u.parts.msw [L182] ieee_double_shape_type sh_u; [L183] sh_u.value = (x) [L184] sh_u.parts.msw = (high & 0x7fffffff) [L185] EXPR sh_u.value [L185] (x) = sh_u.value [L187] return x; VAL [\old(x)=0, \result=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, high=1, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=0, zero_krempio=0, zero_rempio=0] [L453] RET, EXPR fabs_double(x) [L453] t = fabs_double(x) [L454] n = (__int32_t)(t * invpio2_rempio + half_rempio) [L455] fn = (double)n [L456] r = t - fn * pio2_1_rempio [L457] w = fn * pio2_1t_rempio [L458] n < 32 && ix != npio2_hw_rempio[n - 1] VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2147483647, i=1073928572, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, n=-2147483648, n < 32 && ix != npio2_hw_rempio[n - 1]=1, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, t=0, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, tx={13:0}, x=0, y={10:0}, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L458] n - 1 VAL [\old(x)=0, C1_kcos=416666666666666019037/10000000000000000000000, C3_kcos=124007936447383647089/5000000000000000000000000, C5_kcos=20875723212981748279/10000000000000000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2147483647, i=1073928572, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix = hx & 0x7fffffff=2147483647, n=-2147483648, n < 32 && ix != npio2_hw_rempio[n - 1]=1, npio2_hw_rempio={7:0}, one_kcos=1, one_krempio=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=208333333333062236531/25000000000000000000000, S4_ksin=275573137070700676789/100000000000000000000000000, S6_ksin=158969099521155010221/1000000000000000000000000000000, t=0, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, tx={13:0}, x=0, y={10:0}, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 154]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 165]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 165]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 169]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 169]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 458]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 495]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 495]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 516]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 516]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 523]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 523]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 211]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 211]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 212]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 212]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 212]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 212]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 215]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 215]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 215]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 215]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 215]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 215]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 217]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 217]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 218]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 218]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 219]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 224]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 224]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 224]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 224]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 222]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 222]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 234]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 234]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 231]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 231]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 231]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 231]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 243]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 243]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 243]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 243]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 244]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 244]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 245]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 246]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 248]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 248]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 253]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 260]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 260]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 263]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 255]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 255]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 268]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 268]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 271]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 271]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 284]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 284]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 284]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 284]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 287]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 287]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 287]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 287]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 291]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 291]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 291]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 291]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 293]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 293]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 293]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 293]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 292]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 292]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 296]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 296]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 302]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 302]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 303]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 303]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 305]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 305]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 313]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 313]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 314]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 314]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 321]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 321]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 327]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 327]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 328]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 328]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 327]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 327]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 329]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 329]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 326]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 326]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 335]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 335]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 342]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 342]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 346]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 346]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 352]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 352]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 353]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 353]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 354]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 354]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 351]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 351]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 357]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 357]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 358]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 358]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 359]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 359]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 631 locations, 188 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2244 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2236 mSDsluCounter, 8818 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3981 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 4837 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=631occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 [2022-10-16 11:56:11,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...