/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/float_req_bl_0310.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:02:15,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:02:15,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:02:15,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:02:15,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:02:15,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:02:15,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:02:15,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:02:15,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:02:15,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:02:15,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:02:15,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:02:15,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:02:15,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:02:15,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:02:15,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:02:15,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:02:15,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:02:15,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:02:15,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:02:15,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:02:15,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:02:15,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:02:15,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:02:15,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:02:15,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:02:15,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:02:15,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:02:15,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:02:15,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:02:15,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:02:15,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:02:15,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:02:15,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:02:15,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:02:15,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:02:15,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:02:15,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:02:15,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:02:15,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:02:15,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:02:15,322 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 12:02:15,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:02:15,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:02:15,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:02:15,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:02:15,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:02:15,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:02:15,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:02:15,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:02:15,382 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:02:15,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:02:15,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:02:15,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:02:15,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:02:15,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:02:15,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:02:15,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:02:15,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:02:15,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:02:15,385 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:02:15,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:02:15,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:02:15,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:02:15,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:02:15,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:02:15,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:02:15,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:02:15,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:02:15,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:02:15,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:02:15,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:02:15,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:02:15,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:02:15,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:02:15,388 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 12:02:15,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:02:15,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:02:15,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:02:15,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:02:15,841 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:02:15,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0310.c [2022-10-16 12:02:15,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0f65b31/7c439cb377554c63857cf34d76d33fea/FLAG0adbcf11e [2022-10-16 12:02:16,566 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:02:16,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0310.c [2022-10-16 12:02:16,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0f65b31/7c439cb377554c63857cf34d76d33fea/FLAG0adbcf11e [2022-10-16 12:02:16,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0f65b31/7c439cb377554c63857cf34d76d33fea [2022-10-16 12:02:16,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:02:16,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:02:16,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:02:16,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:02:16,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:02:16,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:16" (1/1) ... [2022-10-16 12:02:16,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1c6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:16, skipping insertion in model container [2022-10-16 12:02:16,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:02:16" (1/1) ... [2022-10-16 12:02:16,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:02:16,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:02:17,277 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/float_req_bl_0310.c[15490,15503] [2022-10-16 12:02:17,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:02:17,314 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:02:17,500 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/float_req_bl_0310.c[15490,15503] [2022-10-16 12:02:17,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:02:17,542 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:02:17,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17 WrapperNode [2022-10-16 12:02:17,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:02:17,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:02:17,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:02:17,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:02:17,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,685 INFO L138 Inliner]: procedures = 26, calls = 491, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1303 [2022-10-16 12:02:17,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:02:17,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:02:17,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:02:17,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:02:17,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,819 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:02:17,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:02:17,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:02:17,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:02:17,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (1/1) ... [2022-10-16 12:02:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:02:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:02:17,879 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 12:02:17,903 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 12:02:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_cosf [2022-10-16 12:02:17,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_cosf [2022-10-16 12:02:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:02:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:02:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:02:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:02:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:02:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_sinf [2022-10-16 12:02:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_sinf [2022-10-16 12:02:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2022-10-16 12:02:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2022-10-16 12:02:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:02:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 12:02:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2022-10-16 12:02:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2022-10-16 12:02:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:02:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:02:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:02:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:02:18,163 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:02:18,169 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:02:19,833 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:02:19,847 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:02:19,848 INFO L300 CfgBuilder]: Removed 59 assume(true) statements. [2022-10-16 12:02:19,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:19 BoogieIcfgContainer [2022-10-16 12:02:19,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:02:19,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:02:19,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:02:19,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:02:19,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:02:16" (1/3) ... [2022-10-16 12:02:19,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4cfbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:19, skipping insertion in model container [2022-10-16 12:02:19,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:02:17" (2/3) ... [2022-10-16 12:02:19,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4cfbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:02:19, skipping insertion in model container [2022-10-16 12:02:19,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:02:19" (3/3) ... [2022-10-16 12:02:19,862 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0310.c [2022-10-16 12:02:19,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:02:19,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 174 error locations. [2022-10-16 12:02:19,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:02:19,987 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;@5f3cc461, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:02:19,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 174 error locations. [2022-10-16 12:02:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 592 states, 401 states have (on average 1.827930174563591) internal successors, (733), 575 states have internal predecessors, (733), 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 12:02:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 12:02:20,016 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:20,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:20,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2125049545, now seen corresponding path program 1 times [2022-10-16 12:02:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:20,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033263376] [2022-10-16 12:02:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:20,548 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 12:02:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:20,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033263376] [2022-10-16 12:02:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033263376] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:20,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:20,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98995007] [2022-10-16 12:02:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:20,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:02:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:20,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:02:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:02:20,600 INFO L87 Difference]: Start difference. First operand has 592 states, 401 states have (on average 1.827930174563591) internal successors, (733), 575 states have internal predecessors, (733), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 12:02:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:20,691 INFO L93 Difference]: Finished difference Result 1182 states and 1524 transitions. [2022-10-16 12:02:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:02:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-10-16 12:02:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:20,713 INFO L225 Difference]: With dead ends: 1182 [2022-10-16 12:02:20,713 INFO L226 Difference]: Without dead ends: 563 [2022-10-16 12:02:20,724 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 12:02:20,728 INFO L413 NwaCegarLoop]: 693 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, 693 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 12:02:20,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-10-16 12:02:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-10-16 12:02:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 377 states have (on average 1.6816976127320955) internal successors, (634), 552 states have internal predecessors, (634), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 651 transitions. [2022-10-16 12:02:20,859 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 651 transitions. Word has length 13 [2022-10-16 12:02:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:20,859 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 651 transitions. [2022-10-16 12:02:20,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 12:02:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 651 transitions. [2022-10-16 12:02:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:02:20,861 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:20,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:20,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:02:20,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1748799618, now seen corresponding path program 1 times [2022-10-16 12:02:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:20,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132108846] [2022-10-16 12:02:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:21,186 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 12:02:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132108846] [2022-10-16 12:02:21,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132108846] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:21,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:21,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850864289] [2022-10-16 12:02:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:21,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:21,192 INFO L87 Difference]: Start difference. First operand 563 states and 651 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 12:02:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:21,281 INFO L93 Difference]: Finished difference Result 1118 states and 1292 transitions. [2022-10-16 12:02:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 12:02:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:21,286 INFO L225 Difference]: With dead ends: 1118 [2022-10-16 12:02:21,286 INFO L226 Difference]: Without dead ends: 570 [2022-10-16 12:02:21,288 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 12:02:21,290 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 6 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1275 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 12:02:21,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-10-16 12:02:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564. [2022-10-16 12:02:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 378 states have (on average 1.67989417989418) internal successors, (635), 553 states have internal predecessors, (635), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 652 transitions. [2022-10-16 12:02:21,321 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 652 transitions. Word has length 15 [2022-10-16 12:02:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:21,321 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 652 transitions. [2022-10-16 12:02:21,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 12:02:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 652 transitions. [2022-10-16 12:02:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:02:21,323 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:21,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:21,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:02:21,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:21,324 INFO L85 PathProgramCache]: Analyzing trace with hash -201734293, now seen corresponding path program 1 times [2022-10-16 12:02:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:21,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551164779] [2022-10-16 12:02:21,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:21,520 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 12:02:21,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551164779] [2022-10-16 12:02:21,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551164779] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:21,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:21,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110024330] [2022-10-16 12:02:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:21,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:21,526 INFO L87 Difference]: Start difference. First operand 564 states and 652 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 12:02:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:21,563 INFO L93 Difference]: Finished difference Result 567 states and 655 transitions. [2022-10-16 12:02:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:21,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2022-10-16 12:02:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:21,568 INFO L225 Difference]: With dead ends: 567 [2022-10-16 12:02:21,568 INFO L226 Difference]: Without dead ends: 566 [2022-10-16 12:02:21,570 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 12:02:21,579 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 5 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:21,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1288 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-10-16 12:02:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 563. [2022-10-16 12:02:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 378 states have (on average 1.6772486772486772) internal successors, (634), 552 states have internal predecessors, (634), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 651 transitions. [2022-10-16 12:02:21,616 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 651 transitions. Word has length 17 [2022-10-16 12:02:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:21,617 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 651 transitions. [2022-10-16 12:02:21,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 12:02:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 651 transitions. [2022-10-16 12:02:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 12:02:21,619 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:21,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:21,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:02:21,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1958795716, now seen corresponding path program 1 times [2022-10-16 12:02:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437232077] [2022-10-16 12:02:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:21,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:21,770 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 12:02:21,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:21,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437232077] [2022-10-16 12:02:21,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437232077] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:21,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:21,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:21,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825005072] [2022-10-16 12:02:21,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:21,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:21,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:21,774 INFO L87 Difference]: Start difference. First operand 563 states and 651 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 12:02:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:21,805 INFO L93 Difference]: Finished difference Result 565 states and 653 transitions. [2022-10-16 12:02:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2022-10-16 12:02:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:21,813 INFO L225 Difference]: With dead ends: 565 [2022-10-16 12:02:21,813 INFO L226 Difference]: Without dead ends: 537 [2022-10-16 12:02:21,814 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 12:02:21,826 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 0 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:21,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1286 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-10-16 12:02:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-10-16 12:02:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 356 states have (on average 1.6797752808988764) internal successors, (598), 527 states have internal predecessors, (598), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 612 transitions. [2022-10-16 12:02:21,848 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 612 transitions. Word has length 18 [2022-10-16 12:02:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:21,849 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 612 transitions. [2022-10-16 12:02:21,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 12:02:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 612 transitions. [2022-10-16 12:02:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 12:02:21,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:21,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:21,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:02:21,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1897309095, now seen corresponding path program 1 times [2022-10-16 12:02:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:21,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414432144] [2022-10-16 12:02:21,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:22,028 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 12:02:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414432144] [2022-10-16 12:02:22,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414432144] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:22,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:22,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388452155] [2022-10-16 12:02:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:22,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:22,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:22,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:22,034 INFO L87 Difference]: Start difference. First operand 537 states and 612 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 12:02:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:22,072 INFO L93 Difference]: Finished difference Result 537 states and 612 transitions. [2022-10-16 12:02:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-10-16 12:02:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:22,076 INFO L225 Difference]: With dead ends: 537 [2022-10-16 12:02:22,077 INFO L226 Difference]: Without dead ends: 536 [2022-10-16 12:02:22,077 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 12:02:22,078 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 511 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:22,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 690 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-10-16 12:02:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-10-16 12:02:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 356 states have (on average 1.6769662921348314) internal successors, (597), 526 states have internal predecessors, (597), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 611 transitions. [2022-10-16 12:02:22,096 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 611 transitions. Word has length 18 [2022-10-16 12:02:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:22,097 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 611 transitions. [2022-10-16 12:02:22,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 12:02:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 611 transitions. [2022-10-16 12:02:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 12:02:22,098 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:22,098 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 12:02:22,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:02:22,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:22,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1312959858, now seen corresponding path program 1 times [2022-10-16 12:02:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:22,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730382155] [2022-10-16 12:02:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:22,249 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 12:02:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:22,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730382155] [2022-10-16 12:02:22,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730382155] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:22,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:22,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344173692] [2022-10-16 12:02:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:22,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:22,252 INFO L87 Difference]: Start difference. First operand 536 states and 611 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 12:02:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:22,320 INFO L93 Difference]: Finished difference Result 536 states and 611 transitions. [2022-10-16 12:02:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 12:02:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:22,325 INFO L225 Difference]: With dead ends: 536 [2022-10-16 12:02:22,325 INFO L226 Difference]: Without dead ends: 535 [2022-10-16 12:02:22,326 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 12:02:22,330 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 962 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:22,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 718 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-10-16 12:02:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2022-10-16 12:02:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 356 states have (on average 1.6741573033707866) internal successors, (596), 525 states have internal predecessors, (596), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 610 transitions. [2022-10-16 12:02:22,351 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 610 transitions. Word has length 19 [2022-10-16 12:02:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:22,352 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 610 transitions. [2022-10-16 12:02:22,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 12:02:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 610 transitions. [2022-10-16 12:02:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 12:02:22,357 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:22,357 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] [2022-10-16 12:02:22,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:02:22,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash 965972528, now seen corresponding path program 1 times [2022-10-16 12:02:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:22,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493529146] [2022-10-16 12:02:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:22,548 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 12:02:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:22,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493529146] [2022-10-16 12:02:22,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493529146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:22,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:22,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38072476] [2022-10-16 12:02:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:22,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:22,553 INFO L87 Difference]: Start difference. First operand 535 states and 610 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 12:02:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:22,626 INFO L93 Difference]: Finished difference Result 535 states and 610 transitions. [2022-10-16 12:02:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2022-10-16 12:02:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:22,630 INFO L225 Difference]: With dead ends: 535 [2022-10-16 12:02:22,631 INFO L226 Difference]: Without dead ends: 534 [2022-10-16 12:02:22,631 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 12:02:22,632 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 985 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:22,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 807 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-10-16 12:02:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2022-10-16 12:02:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 356 states have (on average 1.6713483146067416) internal successors, (595), 524 states have internal predecessors, (595), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 609 transitions. [2022-10-16 12:02:22,652 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 609 transitions. Word has length 21 [2022-10-16 12:02:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:22,653 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 609 transitions. [2022-10-16 12:02:22,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 12:02:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 609 transitions. [2022-10-16 12:02:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 12:02:22,654 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:22,654 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 12:02:22,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:02:22,654 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -119622355, now seen corresponding path program 1 times [2022-10-16 12:02:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:22,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908507370] [2022-10-16 12:02:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:22,812 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 12:02:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:22,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908507370] [2022-10-16 12:02:22,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908507370] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:22,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:22,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:02:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253468576] [2022-10-16 12:02:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:22,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:02:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:02:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:02:22,815 INFO L87 Difference]: Start difference. First operand 534 states and 609 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 12:02:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:22,912 INFO L93 Difference]: Finished difference Result 534 states and 609 transitions. [2022-10-16 12:02:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:22,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 12:02:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:22,917 INFO L225 Difference]: With dead ends: 534 [2022-10-16 12:02:22,917 INFO L226 Difference]: Without dead ends: 533 [2022-10-16 12:02:22,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:02:22,918 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 955 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:22,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 951 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-16 12:02:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2022-10-16 12:02:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 356 states have (on average 1.6685393258426966) internal successors, (594), 523 states have internal predecessors, (594), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 608 transitions. [2022-10-16 12:02:22,942 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 608 transitions. Word has length 22 [2022-10-16 12:02:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:22,942 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 608 transitions. [2022-10-16 12:02:22,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 12:02:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 608 transitions. [2022-10-16 12:02:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 12:02:22,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:22,944 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 12:02:22,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:02:22,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 586674642, now seen corresponding path program 1 times [2022-10-16 12:02:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:22,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791043511] [2022-10-16 12:02:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:23,093 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 12:02:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:23,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791043511] [2022-10-16 12:02:23,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791043511] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:23,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:23,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:02:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543962343] [2022-10-16 12:02:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:23,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:02:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:23,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:02:23,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:02:23,096 INFO L87 Difference]: Start difference. First operand 533 states and 608 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 12:02:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:23,147 INFO L93 Difference]: Finished difference Result 533 states and 608 transitions. [2022-10-16 12:02:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:02:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 12:02:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:23,152 INFO L225 Difference]: With dead ends: 533 [2022-10-16 12:02:23,152 INFO L226 Difference]: Without dead ends: 532 [2022-10-16 12:02:23,153 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 12:02:23,154 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 473 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:23,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 716 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-10-16 12:02:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2022-10-16 12:02:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 522 states have internal predecessors, (593), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 607 transitions. [2022-10-16 12:02:23,180 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 607 transitions. Word has length 23 [2022-10-16 12:02:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:23,180 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 607 transitions. [2022-10-16 12:02:23,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 12:02:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 607 transitions. [2022-10-16 12:02:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 12:02:23,181 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:23,181 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 12:02:23,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:02:23,182 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 66429046, now seen corresponding path program 1 times [2022-10-16 12:02:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:23,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628934924] [2022-10-16 12:02:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:23,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:23,386 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 12:02:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628934924] [2022-10-16 12:02:23,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628934924] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:23,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:23,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215122244] [2022-10-16 12:02:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:23,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:23,389 INFO L87 Difference]: Start difference. First operand 532 states and 607 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 12:02:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:23,438 INFO L93 Difference]: Finished difference Result 546 states and 624 transitions. [2022-10-16 12:02:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:23,439 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 12:02:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:23,443 INFO L225 Difference]: With dead ends: 546 [2022-10-16 12:02:23,443 INFO L226 Difference]: Without dead ends: 543 [2022-10-16 12:02:23,444 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 12:02:23,445 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 20 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:23,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1789 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-10-16 12:02:23,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2022-10-16 12:02:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 368 states have (on average 1.6494565217391304) internal successors, (607), 533 states have internal predecessors, (607), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 621 transitions. [2022-10-16 12:02:23,472 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 621 transitions. Word has length 24 [2022-10-16 12:02:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:23,472 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 621 transitions. [2022-10-16 12:02:23,473 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 12:02:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 621 transitions. [2022-10-16 12:02:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 12:02:23,475 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:23,475 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 12:02:23,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:02:23,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1007045071, now seen corresponding path program 1 times [2022-10-16 12:02:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:23,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211946974] [2022-10-16 12:02:23,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:02:23,612 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 12:02:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:02:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211946974] [2022-10-16 12:02:23,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211946974] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:02:23,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:02:23,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:02:23,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38495342] [2022-10-16 12:02:23,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:02:23,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:02:23,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:02:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:02:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:02:23,615 INFO L87 Difference]: Start difference. First operand 543 states and 621 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 12:02:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:02:23,691 INFO L93 Difference]: Finished difference Result 543 states and 621 transitions. [2022-10-16 12:02:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:02:23,692 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 12:02:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:02:23,695 INFO L225 Difference]: With dead ends: 543 [2022-10-16 12:02:23,696 INFO L226 Difference]: Without dead ends: 542 [2022-10-16 12:02:23,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 12:02:23,697 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 946 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:02:23,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 825 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:02:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-10-16 12:02:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2022-10-16 12:02:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 368 states have (on average 1.6467391304347827) internal successors, (606), 532 states have internal predecessors, (606), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-16 12:02:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 620 transitions. [2022-10-16 12:02:23,723 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 620 transitions. Word has length 24 [2022-10-16 12:02:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:02:23,723 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 620 transitions. [2022-10-16 12:02:23,723 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 12:02:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 620 transitions. [2022-10-16 12:02:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 12:02:23,724 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:02:23,724 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 12:02:23,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:02:23,725 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 171 more)] === [2022-10-16 12:02:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:02:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2059300700, now seen corresponding path program 1 times [2022-10-16 12:02:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:02:23,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667123736] [2022-10-16 12:02:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:02:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:02:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:02:23,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:02:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:02:23,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:02:24,000 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:02:24,001 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 174 remaining) [2022-10-16 12:02:24,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_cosfErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 174 remaining) [2022-10-16 12:02:24,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_cosfErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 174 remaining) [2022-10-16 12:02:24,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 174 remaining) [2022-10-16 12:02:24,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 174 remaining) [2022-10-16 12:02:24,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 174 remaining) [2022-10-16 12:02:24,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 174 remaining) [2022-10-16 12:02:24,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 174 remaining) [2022-10-16 12:02:24,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 174 remaining) [2022-10-16 12:02:24,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 174 remaining) [2022-10-16 12:02:24,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 174 remaining) [2022-10-16 12:02:24,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 174 remaining) [2022-10-16 12:02:24,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 174 remaining) [2022-10-16 12:02:24,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 174 remaining) [2022-10-16 12:02:24,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 174 remaining) [2022-10-16 12:02:24,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 174 remaining) [2022-10-16 12:02:24,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 174 remaining) [2022-10-16 12:02:24,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 174 remaining) [2022-10-16 12:02:24,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 174 remaining) [2022-10-16 12:02:24,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 174 remaining) [2022-10-16 12:02:24,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 174 remaining) [2022-10-16 12:02:24,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 174 remaining) [2022-10-16 12:02:24,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 174 remaining) [2022-10-16 12:02:24,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 174 remaining) [2022-10-16 12:02:24,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 174 remaining) [2022-10-16 12:02:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 174 remaining) [2022-10-16 12:02:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 174 remaining) [2022-10-16 12:02:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 174 remaining) [2022-10-16 12:02:24,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 174 remaining) [2022-10-16 12:02:24,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 174 remaining) [2022-10-16 12:02:24,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 174 remaining) [2022-10-16 12:02:24,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 174 remaining) [2022-10-16 12:02:24,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 174 remaining) [2022-10-16 12:02:24,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 174 remaining) [2022-10-16 12:02:24,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 174 remaining) [2022-10-16 12:02:24,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 174 remaining) [2022-10-16 12:02:24,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 174 remaining) [2022-10-16 12:02:24,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 174 remaining) [2022-10-16 12:02:24,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 174 remaining) [2022-10-16 12:02:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 174 remaining) [2022-10-16 12:02:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 174 remaining) [2022-10-16 12:02:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 174 remaining) [2022-10-16 12:02:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 174 remaining) [2022-10-16 12:02:24,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 174 remaining) [2022-10-16 12:02:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 174 remaining) [2022-10-16 12:02:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 174 remaining) [2022-10-16 12:02:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 174 remaining) [2022-10-16 12:02:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 174 remaining) [2022-10-16 12:02:24,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 174 remaining) [2022-10-16 12:02:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 174 remaining) [2022-10-16 12:02:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 174 remaining) [2022-10-16 12:02:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 174 remaining) [2022-10-16 12:02:24,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 174 remaining) [2022-10-16 12:02:24,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 174 remaining) [2022-10-16 12:02:24,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 174 remaining) [2022-10-16 12:02:24,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 174 remaining) [2022-10-16 12:02:24,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 174 remaining) [2022-10-16 12:02:24,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 174 remaining) [2022-10-16 12:02:24,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 174 remaining) [2022-10-16 12:02:24,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 174 remaining) [2022-10-16 12:02:24,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 174 remaining) [2022-10-16 12:02:24,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 174 remaining) [2022-10-16 12:02:24,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 174 remaining) [2022-10-16 12:02:24,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 174 remaining) [2022-10-16 12:02:24,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 174 remaining) [2022-10-16 12:02:24,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 174 remaining) [2022-10-16 12:02:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 174 remaining) [2022-10-16 12:02:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 174 remaining) [2022-10-16 12:02:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 174 remaining) [2022-10-16 12:02:24,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 174 remaining) [2022-10-16 12:02:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 174 remaining) [2022-10-16 12:02:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 174 remaining) [2022-10-16 12:02:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 174 remaining) [2022-10-16 12:02:24,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 174 remaining) [2022-10-16 12:02:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 174 remaining) [2022-10-16 12:02:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 174 remaining) [2022-10-16 12:02:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 174 remaining) [2022-10-16 12:02:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 174 remaining) [2022-10-16 12:02:24,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 174 remaining) [2022-10-16 12:02:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 174 remaining) [2022-10-16 12:02:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 174 remaining) [2022-10-16 12:02:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 174 remaining) [2022-10-16 12:02:24,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 174 remaining) [2022-10-16 12:02:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 174 remaining) [2022-10-16 12:02:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 174 remaining) [2022-10-16 12:02:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 174 remaining) [2022-10-16 12:02:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 174 remaining) [2022-10-16 12:02:24,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 174 remaining) [2022-10-16 12:02:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 174 remaining) [2022-10-16 12:02:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 174 remaining) [2022-10-16 12:02:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 174 remaining) [2022-10-16 12:02:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 174 remaining) [2022-10-16 12:02:24,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 174 remaining) [2022-10-16 12:02:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 174 remaining) [2022-10-16 12:02:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 174 remaining) [2022-10-16 12:02:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 174 remaining) [2022-10-16 12:02:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 174 remaining) [2022-10-16 12:02:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 174 remaining) [2022-10-16 12:02:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 174 remaining) [2022-10-16 12:02:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 174 remaining) [2022-10-16 12:02:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 174 remaining) [2022-10-16 12:02:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 174 remaining) [2022-10-16 12:02:24,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 174 remaining) [2022-10-16 12:02:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 174 remaining) [2022-10-16 12:02:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 174 remaining) [2022-10-16 12:02:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 174 remaining) [2022-10-16 12:02:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 174 remaining) [2022-10-16 12:02:24,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 174 remaining) [2022-10-16 12:02:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 174 remaining) [2022-10-16 12:02:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 174 remaining) [2022-10-16 12:02:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 174 remaining) [2022-10-16 12:02:24,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 174 remaining) [2022-10-16 12:02:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 174 remaining) [2022-10-16 12:02:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 174 remaining) [2022-10-16 12:02:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 174 remaining) [2022-10-16 12:02:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 174 remaining) [2022-10-16 12:02:24,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 174 remaining) [2022-10-16 12:02:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 174 remaining) [2022-10-16 12:02:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 174 remaining) [2022-10-16 12:02:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 174 remaining) [2022-10-16 12:02:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 174 remaining) [2022-10-16 12:02:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 174 remaining) [2022-10-16 12:02:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 174 remaining) [2022-10-16 12:02:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 174 remaining) [2022-10-16 12:02:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 174 remaining) [2022-10-16 12:02:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 174 remaining) [2022-10-16 12:02:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 174 remaining) [2022-10-16 12:02:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 174 remaining) [2022-10-16 12:02:24,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 174 remaining) [2022-10-16 12:02:24,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 174 remaining) [2022-10-16 12:02:24,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 174 remaining) [2022-10-16 12:02:24,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 174 remaining) [2022-10-16 12:02:24,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 174 remaining) [2022-10-16 12:02:24,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 174 remaining) [2022-10-16 12:02:24,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 174 remaining) [2022-10-16 12:02:24,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 174 remaining) [2022-10-16 12:02:24,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 174 remaining) [2022-10-16 12:02:24,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 174 remaining) [2022-10-16 12:02:24,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 174 remaining) [2022-10-16 12:02:24,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 174 remaining) [2022-10-16 12:02:24,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 174 remaining) [2022-10-16 12:02:24,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 174 remaining) [2022-10-16 12:02:24,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 174 remaining) [2022-10-16 12:02:24,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 174 remaining) [2022-10-16 12:02:24,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 174 remaining) [2022-10-16 12:02:24,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 174 remaining) [2022-10-16 12:02:24,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 174 remaining) [2022-10-16 12:02:24,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 174 remaining) [2022-10-16 12:02:24,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 174 remaining) [2022-10-16 12:02:24,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 174 remaining) [2022-10-16 12:02:24,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 174 remaining) [2022-10-16 12:02:24,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 174 remaining) [2022-10-16 12:02:24,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 174 remaining) [2022-10-16 12:02:24,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 174 remaining) [2022-10-16 12:02:24,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 174 remaining) [2022-10-16 12:02:24,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 174 remaining) [2022-10-16 12:02:24,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 174 remaining) [2022-10-16 12:02:24,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 174 remaining) [2022-10-16 12:02:24,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 174 remaining) [2022-10-16 12:02:24,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 174 remaining) [2022-10-16 12:02:24,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 174 remaining) [2022-10-16 12:02:24,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 174 remaining) [2022-10-16 12:02:24,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 174 remaining) [2022-10-16 12:02:24,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 174 remaining) [2022-10-16 12:02:24,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 174 remaining) [2022-10-16 12:02:24,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 174 remaining) [2022-10-16 12:02:24,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 174 remaining) [2022-10-16 12:02:24,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 174 remaining) [2022-10-16 12:02:24,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 174 remaining) [2022-10-16 12:02:24,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 174 remaining) [2022-10-16 12:02:24,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 174 remaining) [2022-10-16 12:02:24,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 174 remaining) [2022-10-16 12:02:24,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 174 remaining) [2022-10-16 12:02:24,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_floatErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 174 remaining) [2022-10-16 12:02:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 12:02:24,045 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:02:24,052 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:02:24,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:02:24 BoogieIcfgContainer [2022-10-16 12:02:24,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:02:24,160 INFO L158 Benchmark]: Toolchain (without parser) took 7292.07ms. Allocated memory was 151.0MB in the beginning and 261.1MB in the end (delta: 110.1MB). Free memory was 123.6MB in the beginning and 184.6MB in the end (delta: -61.0MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2022-10-16 12:02:24,160 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:02:24,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.22ms. Allocated memory is still 151.0MB. Free memory was 123.4MB in the beginning and 96.3MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-10-16 12:02:24,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.39ms. Allocated memory is still 151.0MB. Free memory was 96.3MB in the beginning and 87.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-16 12:02:24,161 INFO L158 Benchmark]: Boogie Preprocessor took 153.37ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 80.4MB in the end (delta: 7.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-10-16 12:02:24,163 INFO L158 Benchmark]: RCFGBuilder took 2010.57ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 80.4MB in the beginning and 140.5MB in the end (delta: -60.1MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. [2022-10-16 12:02:24,163 INFO L158 Benchmark]: TraceAbstraction took 4304.44ms. Allocated memory was 201.3MB in the beginning and 261.1MB in the end (delta: 59.8MB). Free memory was 140.0MB in the beginning and 184.6MB in the end (delta: -44.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-10-16 12:02:24,168 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.24ms. Allocated memory is still 151.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 670.22ms. Allocated memory is still 151.0MB. Free memory was 123.4MB in the beginning and 96.3MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 141.39ms. Allocated memory is still 151.0MB. Free memory was 96.3MB in the beginning and 87.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 153.37ms. Allocated memory is still 151.0MB. Free memory was 87.9MB in the beginning and 80.4MB in the end (delta: 7.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2010.57ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 80.4MB in the beginning and 140.5MB in the end (delta: -60.1MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4304.44ms. Allocated memory was 201.3MB in the beginning and 261.1MB in the end (delta: 59.8MB). Free memory was 140.0MB in the beginning and 184.6MB in the end (delta: -44.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 430]: 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 426, overapproximation of someUnaryDOUBLEoperation at line 500, overapproximation of bitwiseAnd at line 150, overapproximation of to_real at line 427, overapproximation of someBinaryArithmeticFLOAToperation at line 428. Possible FailurePath: [L18] static const float huge_floor = 1.0e30; [L86-L88] static const float two25_scalbn = 3.355443200e+07, twom25_scalbn = 2.9802322388e-08, huge_scalbn = 1.0e+30, tiny_scalbn = 1.0e-30; [L158] static const int init_jk_krempio[] = {4, 7, 9}; [L160-L164] static const float PIo2_krempio[] = { 1.5703125000e+00, 4.5776367188e-04, 2.5987625122e-05, 7.5437128544e-08, 6.0026650317e-11, 7.3896444519e-13, 5.3845816694e-15, 5.6378512969e-18, 8.3009228831e-20, 3.2756352257e-22, 6.3331015649e-25, }; [L166-L168] static const float zero_krempio = 0.0, one_krempio = 1.0, two8_krempio = 2.5600000000e+02, twon8_krempio = 3.9062500000e-03; [L343-L361] static const __int32_t two_over_pi_rempio[] = { 0xA2, 0xF9, 0x83, 0x6E, 0x4E, 0x44, 0x15, 0x29, 0xFC, 0x27, 0x57, 0xD1, 0xF5, 0x34, 0xDD, 0xC0, 0xDB, 0x62, 0x95, 0x99, 0x3C, 0x43, 0x90, 0x41, 0xFE, 0x51, 0x63, 0xAB, 0xDE, 0xBB, 0xC5, 0x61, 0xB7, 0x24, 0x6E, 0x3A, 0x42, 0x4D, 0xD2, 0xE0, 0x06, 0x49, 0x2E, 0xEA, 0x09, 0xD1, 0x92, 0x1C, 0xFE, 0x1D, 0xEB, 0x1C, 0xB1, 0x29, 0xA7, 0x3E, 0xE8, 0x82, 0x35, 0xF5, 0x2E, 0xBB, 0x44, 0x84, 0xE9, 0x9C, 0x70, 0x26, 0xB4, 0x5F, 0x7E, 0x41, 0x39, 0x91, 0xD6, 0x39, 0x83, 0x53, 0x39, 0xF4, 0x9C, 0x84, 0x5F, 0x8B, 0xBD, 0xF9, 0x28, 0x3B, 0x1F, 0xF8, 0x97, 0xFF, 0xDE, 0x05, 0x98, 0x0F, 0xEF, 0x2F, 0x11, 0x8B, 0x5A, 0x0A, 0x6D, 0x1F, 0x6D, 0x36, 0x7E, 0xCF, 0x27, 0xCB, 0x09, 0xB7, 0x4F, 0x46, 0x3F, 0x66, 0x9E, 0x5F, 0xEA, 0x2D, 0x75, 0x27, 0xBA, 0xC7, 0xEB, 0xE5, 0xF1, 0x7B, 0x3D, 0x07, 0x39, 0xF7, 0x8A, 0x52, 0x92, 0xEA, 0x6B, 0xFB, 0x5F, 0xB1, 0x1F, 0x8D, 0x5D, 0x08, 0x56, 0x03, 0x30, 0x46, 0xFC, 0x7B, 0x6B, 0xAB, 0xF0, 0xCF, 0xBC, 0x20, 0x9A, 0xF4, 0x36, 0x1D, 0xA9, 0xE3, 0x91, 0x61, 0x5E, 0xE6, 0x1B, 0x08, 0x65, 0x99, 0x85, 0x5F, 0x14, 0xA0, 0x68, 0x40, 0x8D, 0xFF, 0xD8, 0x80, 0x4D, 0x73, 0x27, 0x31, 0x06, 0x06, 0x15, 0x56, 0xCA, 0x73, 0xA8, 0xC9, 0x60, 0xE2, 0x7B, 0xC0, 0x8C, 0x6B, }; [L363-L369] static const __int32_t npio2_hw_rempio[] = { 0x3fc90f00, 0x40490f00, 0x4096cb00, 0x40c90f00, 0x40fb5300, 0x4116cb00, 0x412fed00, 0x41490f00, 0x41623100, 0x417b5300, 0x418a3a00, 0x4196cb00, 0x41a35c00, 0x41afed00, 0x41bc7e00, 0x41c90f00, 0x41d5a000, 0x41e23100, 0x41eec200, 0x41fb5300, 0x4203f200, 0x420a3a00, 0x42108300, 0x4216cb00, 0x421d1400, 0x42235c00, 0x4229a500, 0x422fed00, 0x42363600, 0x423c7e00, 0x4242c700, 0x42490f00}; [L371-L380] static const float zero_rempio = 0.0000000000e+00, half_rempio = 5.0000000000e-01, two8_rempio = 2.5600000000e+02, invpio2_rempio = 6.3661980629e-01, pio2_1_rempio = 1.5707855225e+00, pio2_1t_rempio = 1.0804334124e-05, pio2_2_rempio = 1.0804273188e-05, pio2_2t_rempio = 6.0770999344e-11, pio2_3_rempio = 6.0770943833e-11, pio2_3t_rempio = 6.1232342629e-17; [L500-L503] static const float half_ksin = 5.0000000000e-01, S1_ksin = -1.6666667163e-01, S2_ksin = 8.3333337680e-03, S3_ksin = -1.9841270114e-04, S4_ksin = 2.7557314297e-06, S5_ksin = -2.5050759689e-08, S6_ksin = 1.5896910177e-10; [L527-L530] static const float one_kcos = 1.0000000000e+00, C1_kcos = 4.1666667908e-02, C2_kcos = -1.3888889225e-03, C3_kcos = 2.4801587642e-05, C4_kcos = -2.7557314297e-07, C5_kcos = 2.0875723372e-09, C6_kcos = -1.1359647598e-11; [L567] static const float one_cos = 1.0; VAL [C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, zero_krempio=0, zero_rempio=0] [L608] float x = 0.0f / 0.0f; [L609] CALL cos_float(x) [L570] float y[2], z = 0.0; [L571] __int32_t n, ix; VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000023, y={13:0}, z=0, zero_krempio=0, zero_rempio=0] [L574] ieee_float_shape_type gf_u; [L575] gf_u.value = (x) [L576] EXPR gf_u.word [L576] (ix) = gf_u.word [L579] ix &= 0x7fffffff VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1061752793, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000023, y={13:0}, z=0, zero_krempio=0, zero_rempio=0] [L580] COND FALSE !(ix <= 0x3f490fd8) VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1061752793, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000023, y={13:0}, z=0, zero_krempio=0, zero_rempio=0] [L583] COND FALSE !(!((ix) < 0x7f800000L)) [L587] CALL __ieee754_rem_pio2f(x, y) [L383] float z, w, t, r, fn; [L384] float tx[3]; [L385] __int32_t i, j, n, ix, hx; [L386] int e0, nx; VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={18:0}, x=1000000000000000000000000000023, y={13:0}, y={13:0}, zero_krempio=0, zero_rempio=0] [L389] ieee_float_shape_type gf_u; [L390] gf_u.value = (x) [L391] EXPR gf_u.word [L391] (hx) = gf_u.word [L393] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={18:0}, x=1000000000000000000000000000023, y={13:0}, y={13:0}, zero_krempio=0, zero_rempio=0] [L394] COND FALSE !(ix <= 0x3f490fd8) VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={18:0}, x=1000000000000000000000000000023, y={13:0}, y={13:0}, zero_krempio=0, zero_rempio=0] [L399] COND FALSE !(ix < 0x4016cbe4) VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={18:0}, x=1000000000000000000000000000023, y={13:0}, y={13:0}, zero_krempio=0, zero_rempio=0] [L424] COND TRUE ix <= 0x43490f80 [L425] CALL, EXPR fabs_float(x) [L142] __uint32_t ix; VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000023, zero_krempio=0, zero_rempio=0] [L144] ieee_float_shape_type gf_u; [L145] gf_u.value = (x) [L146] EXPR gf_u.word [L146] (ix) = gf_u.word [L149] ieee_float_shape_type sf_u; [L150] sf_u.word = (ix & 0x7fffffff) [L151] EXPR sf_u.value [L151] (x) = sf_u.value [L153] return x; VAL [\old(x)=1000000000000000000000000000023, \result=1000000000000000000000000000024, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix=1073741825, ix = hx & 0x7fffffff=2147483647, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, x=1000000000000000000000000000024, zero_krempio=0, zero_rempio=0] [L425] RET, EXPR fabs_float(x) [L425] t = fabs_float(x) [L426] n = (__int32_t)(t * invpio2_rempio + half_rempio) [L427] fn = (float)n [L428] r = t - fn * pio2_1_rempio [L429] w = fn * pio2_1t_rempio [L430] n < 32 && (ix & 0xffffff00) != npio2_hw_rempio[n - 1] VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, n=-2147483648, n < 32 && (ix & 0xffffff00) != npio2_hw_rempio[n - 1]=1, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, t=1000000000000000000000000000024, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={18:0}, x=1000000000000000000000000000023, y={13:0}, y={13:0}, zero_krempio=0, zero_rempio=0] [L430] n - 1 VAL [\old(x)=1000000000000000000000000000023, C1_kcos=10416666977/250000000000, C3_kcos=12400793821/500000000000000, C5_kcos=5218930843/2500000000000000000, half_ksin=1/2, half_rempio=1/2, huge_floor=1000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000, hx=2147483647, i=1075235812, init_jk_krempio={4:0}, invpio2_rempio=63661980629/100000000000, ix = hx & 0x7fffffff=2147483647, n=-2147483648, n < 32 && (ix & 0xffffff00) != npio2_hw_rempio[n - 1]=1, npio2_hw_rempio={7:0}, one_cos=1, one_kcos=1, one_krempio=1, pio2_1_rempio=628314209/400000000, pio2_1t_rempio=2701083531/250000000000000, pio2_2_rempio=2701068297/250000000000000, pio2_2t_rempio=3798187459/62500000000000000000, pio2_3_rempio=60770943833/1000000000000000000000, pio2_3t_rempio=61232342629/1000000000000000000000000000, PIo2_krempio={5:0}, S2_ksin=1041666721/125000000000, S4_ksin=27557314297/10000000000000000, S6_ksin=15896910177/100000000000000000000, t=1000000000000000000000000000024, tiny_scalbn=1/1000000000000000000000000000000, two25_scalbn=33554432, two8_krempio=256, two8_rempio=256, two_over_pi_rempio={6:0}, twom25_scalbn=7450580597/250000000000000000, twon8_krempio=1/256, tx={18:0}, x=1000000000000000000000000000023, y={13:0}, y={13:0}, zero_krempio=0, zero_rempio=0] - UnprovableResult [Line: 557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 430]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 467]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 467]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 477]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 477]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 480]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 480]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 480]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 480]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 483]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 483]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 489]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 489]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 490]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 490]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 179]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 179]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 179]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 179]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 182]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 182]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 182]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 182]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 182]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 182]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 184]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 184]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 185]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 185]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 186]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 191]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 191]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 191]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 191]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 190]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 190]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 189]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 210]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 210]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 210]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 210]: 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: 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: 213]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 213]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 213]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 213]: 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: 220]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 220]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 227]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 227]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 230]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 230]: 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: 235]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 235]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 238]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 238]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 251]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 251]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 251]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 251]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 254]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 254]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 254]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 254]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 258]: 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: 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: 259]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 259]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 257]: 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: 269]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 269]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 270]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 270]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 272]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 272]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 273]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 273]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 276]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 276]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 280]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 280]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 281]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 281]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 288]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 288]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 294]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 294]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 294]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 294]: 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: 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: 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: 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: 319]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 319]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 320]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 320]: 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: 318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 324]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 324]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 325]: 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: 323]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 323]: 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: 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: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 122]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 122]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 136]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 136]: 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, 592 locations, 174 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4875 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4863 mSDsluCounter, 11038 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4193 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 6845 mSDtfsCounter, 192 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 12:02:24,252 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...