/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-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/float_req_bl_0681b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:09,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:09,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:09,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:09,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:09,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:09,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:09,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:09,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:09,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:09,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:09,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:09,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:09,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:09,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:09,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:09,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:09,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:09,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:09,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:09,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:09,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:09,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:09,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:09,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:09,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:09,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:09,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:09,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:09,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:09,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:09,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:09,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:09,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:09,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:09,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:09,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:09,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:09,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:09,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:09,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:09,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:45:10,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:10,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:10,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:10,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:10,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:10,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:10,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:10,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:10,014 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:10,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:10,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:10,016 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:10,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:10,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:10,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:10,016 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:10,017 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:10,017 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:10,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:10,017 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:10,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:10,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:10,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:10,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:10,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:10,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:10,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:10,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:10,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:10,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:10,020 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-15 16:45:10,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:10,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:10,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:10,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:10,508 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:10,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0681b.c [2022-10-15 16:45:10,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed34ec086/c09042b0d7e64970955cbff471133989/FLAG99b10b71b [2022-10-15 16:45:11,302 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:11,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0681b.c [2022-10-15 16:45:11,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed34ec086/c09042b0d7e64970955cbff471133989/FLAG99b10b71b [2022-10-15 16:45:11,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed34ec086/c09042b0d7e64970955cbff471133989 [2022-10-15 16:45:11,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:11,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:11,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:11,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:11,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:11,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:11" (1/1) ... [2022-10-15 16:45:11,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:11, skipping insertion in model container [2022-10-15 16:45:11,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:11" (1/1) ... [2022-10-15 16:45:11,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:11,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:12,095 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_0681b.c[5432,5445] [2022-10-15 16:45:12,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:12,123 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:12,226 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_0681b.c[5432,5445] [2022-10-15 16:45:12,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:12,262 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:12,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12 WrapperNode [2022-10-15 16:45:12,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:12,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:12,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:12,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:12,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,347 INFO L138 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 276 [2022-10-15 16:45:12,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:12,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:12,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:12,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:12,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,404 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:12,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:12,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:12,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:12,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:12,458 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-15 16:45:12,469 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-15 16:45:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-10-15 16:45:12,539 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-10-15 16:45:12,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:12,540 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-10-15 16:45:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-10-15 16:45:12,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:12,744 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:12,747 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:13,806 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:13,828 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:13,828 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 16:45:13,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:13 BoogieIcfgContainer [2022-10-15 16:45:13,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:13,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:13,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:13,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:13,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:11" (1/3) ... [2022-10-15 16:45:13,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b43b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:13, skipping insertion in model container [2022-10-15 16:45:13,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12" (2/3) ... [2022-10-15 16:45:13,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b43b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:13, skipping insertion in model container [2022-10-15 16:45:13,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:13" (3/3) ... [2022-10-15 16:45:13,850 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0681b.c [2022-10-15 16:45:13,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:13,880 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2022-10-15 16:45:13,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:13,986 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2cf8bf05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:13,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2022-10-15 16:45:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 146 states have (on average 1.9589041095890412) internal successors, (286), 214 states have internal predecessors, (286), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:14,013 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:14,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:14,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2156997, now seen corresponding path program 1 times [2022-10-15 16:45:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:14,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809333285] [2022-10-15 16:45:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:14,556 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-15 16:45:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:14,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809333285] [2022-10-15 16:45:14,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809333285] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:14,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:14,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864416076] [2022-10-15 16:45:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:14,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:14,628 INFO L87 Difference]: Start difference. First operand has 221 states, 146 states have (on average 1.9589041095890412) internal successors, (286), 214 states have internal predecessors, (286), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-15 16:45:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:14,887 INFO L93 Difference]: Finished difference Result 219 states and 269 transitions. [2022-10-15 16:45:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-10-15 16:45:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:14,903 INFO L225 Difference]: With dead ends: 219 [2022-10-15 16:45:14,904 INFO L226 Difference]: Without dead ends: 217 [2022-10-15 16:45:14,906 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-15 16:45:14,911 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 4 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:14,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 447 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:45:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-10-15 16:45:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-10-15 16:45:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 145 states have (on average 1.7862068965517242) internal successors, (259), 210 states have internal predecessors, (259), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 267 transitions. [2022-10-15 16:45:14,982 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 267 transitions. Word has length 4 [2022-10-15 16:45:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:14,983 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 267 transitions. [2022-10-15 16:45:14,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-15 16:45:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 267 transitions. [2022-10-15 16:45:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:14,984 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:14,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:14,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2156998, now seen corresponding path program 1 times [2022-10-15 16:45:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:14,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608164711] [2022-10-15 16:45:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:14,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:15,176 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-15 16:45:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:15,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608164711] [2022-10-15 16:45:15,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608164711] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:15,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:15,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628575952] [2022-10-15 16:45:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:15,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:15,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:15,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:15,185 INFO L87 Difference]: Start difference. First operand 217 states and 267 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-15 16:45:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:15,321 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2022-10-15 16:45:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-10-15 16:45:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:15,325 INFO L225 Difference]: With dead ends: 215 [2022-10-15 16:45:15,325 INFO L226 Difference]: Without dead ends: 215 [2022-10-15 16:45:15,326 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-15 16:45:15,328 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 2 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:15,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 452 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-10-15 16:45:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-10-15 16:45:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 145 states have (on average 1.7724137931034483) internal successors, (257), 208 states have internal predecessors, (257), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 265 transitions. [2022-10-15 16:45:15,397 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 265 transitions. Word has length 4 [2022-10-15 16:45:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:15,398 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 265 transitions. [2022-10-15 16:45:15,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-15 16:45:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 265 transitions. [2022-10-15 16:45:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:45:15,399 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:15,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:15,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:15,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -861169776, now seen corresponding path program 1 times [2022-10-15 16:45:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:15,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908133458] [2022-10-15 16:45:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:15,589 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-15 16:45:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:15,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908133458] [2022-10-15 16:45:15,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908133458] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:15,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:15,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011533468] [2022-10-15 16:45:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:15,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:15,593 INFO L87 Difference]: Start difference. First operand 215 states and 265 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-15 16:45:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:15,722 INFO L93 Difference]: Finished difference Result 213 states and 263 transitions. [2022-10-15 16:45:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-15 16:45:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:15,724 INFO L225 Difference]: With dead ends: 213 [2022-10-15 16:45:15,725 INFO L226 Difference]: Without dead ends: 213 [2022-10-15 16:45:15,725 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-15 16:45:15,727 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:15,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 438 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-10-15 16:45:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-10-15 16:45:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 145 states have (on average 1.7586206896551724) internal successors, (255), 206 states have internal predecessors, (255), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2022-10-15 16:45:15,745 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 10 [2022-10-15 16:45:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:15,745 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2022-10-15 16:45:15,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-15 16:45:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2022-10-15 16:45:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:45:15,747 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:15,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:15,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:15,748 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash -861169775, now seen corresponding path program 1 times [2022-10-15 16:45:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:15,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022420291] [2022-10-15 16:45:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:15,916 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-15 16:45:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022420291] [2022-10-15 16:45:15,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022420291] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:15,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:15,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241621770] [2022-10-15 16:45:15,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:15,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:15,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:15,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:15,920 INFO L87 Difference]: Start difference. First operand 213 states and 263 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-15 16:45:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,040 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2022-10-15 16:45:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:16,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-15 16:45:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,042 INFO L225 Difference]: With dead ends: 211 [2022-10-15 16:45:16,043 INFO L226 Difference]: Without dead ends: 211 [2022-10-15 16:45:16,043 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-15 16:45:16,055 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 446 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-10-15 16:45:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-10-15 16:45:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 145 states have (on average 1.7448275862068965) internal successors, (253), 204 states have internal predecessors, (253), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2022-10-15 16:45:16,087 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 10 [2022-10-15 16:45:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,087 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2022-10-15 16:45:16,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-15 16:45:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2022-10-15 16:45:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:45:16,089 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,089 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-15 16:45:16,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:16,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2025359903, now seen corresponding path program 1 times [2022-10-15 16:45:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102949885] [2022-10-15 16:45:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,271 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-15 16:45:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102949885] [2022-10-15 16:45:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102949885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845337979] [2022-10-15 16:45:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:16,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:16,277 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand has 4 states, 4 states have (on average 4.75) 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-15 16:45:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,332 INFO L93 Difference]: Finished difference Result 284 states and 355 transitions. [2022-10-15 16:45:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) 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-15 16:45:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,335 INFO L225 Difference]: With dead ends: 284 [2022-10-15 16:45:16,335 INFO L226 Difference]: Without dead ends: 284 [2022-10-15 16:45:16,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-15 16:45:16,337 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 87 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 769 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-10-15 16:45:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 241. [2022-10-15 16:45:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 175 states have (on average 1.72) internal successors, (301), 234 states have internal predecessors, (301), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 309 transitions. [2022-10-15 16:45:16,351 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 309 transitions. Word has length 19 [2022-10-15 16:45:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,352 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 309 transitions. [2022-10-15 16:45:16,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) 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-15 16:45:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 309 transitions. [2022-10-15 16:45:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:45:16,353 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,353 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] [2022-10-15 16:45:16,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:16,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1771806719, now seen corresponding path program 1 times [2022-10-15 16:45:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087648886] [2022-10-15 16:45:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,416 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-15 16:45:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087648886] [2022-10-15 16:45:16,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087648886] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:16,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189253708] [2022-10-15 16:45:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:16,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:16,419 INFO L87 Difference]: Start difference. First operand 241 states and 309 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-15 16:45:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,471 INFO L93 Difference]: Finished difference Result 259 states and 322 transitions. [2022-10-15 16:45:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:16,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2022-10-15 16:45:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,474 INFO L225 Difference]: With dead ends: 259 [2022-10-15 16:45:16,474 INFO L226 Difference]: Without dead ends: 259 [2022-10-15 16:45:16,475 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-15 16:45:16,476 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 46 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 498 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-10-15 16:45:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 239. [2022-10-15 16:45:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 173 states have (on average 1.69364161849711) internal successors, (293), 232 states have internal predecessors, (293), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 301 transitions. [2022-10-15 16:45:16,486 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 301 transitions. Word has length 20 [2022-10-15 16:45:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,487 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 301 transitions. [2022-10-15 16:45:16,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-15 16:45:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 301 transitions. [2022-10-15 16:45:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:45:16,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,489 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-15 16:45:16,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:16,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2042503106, now seen corresponding path program 1 times [2022-10-15 16:45:16,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983978244] [2022-10-15 16:45:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:16,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:16,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:16,657 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:16,659 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (67 of 68 remaining) [2022-10-15 16:45:16,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 68 remaining) [2022-10-15 16:45:16,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 68 remaining) [2022-10-15 16:45:16,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 68 remaining) [2022-10-15 16:45:16,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 68 remaining) [2022-10-15 16:45:16,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 68 remaining) [2022-10-15 16:45:16,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2022-10-15 16:45:16,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2022-10-15 16:45:16,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 68 remaining) [2022-10-15 16:45:16,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 68 remaining) [2022-10-15 16:45:16,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 68 remaining) [2022-10-15 16:45:16,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2022-10-15 16:45:16,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2022-10-15 16:45:16,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2022-10-15 16:45:16,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2022-10-15 16:45:16,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2022-10-15 16:45:16,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2022-10-15 16:45:16,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2022-10-15 16:45:16,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2022-10-15 16:45:16,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2022-10-15 16:45:16,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2022-10-15 16:45:16,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2022-10-15 16:45:16,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2022-10-15 16:45:16,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 68 remaining) [2022-10-15 16:45:16,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2022-10-15 16:45:16,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2022-10-15 16:45:16,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2022-10-15 16:45:16,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2022-10-15 16:45:16,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2022-10-15 16:45:16,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (38 of 68 remaining) [2022-10-15 16:45:16,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2022-10-15 16:45:16,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2022-10-15 16:45:16,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2022-10-15 16:45:16,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2022-10-15 16:45:16,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 68 remaining) [2022-10-15 16:45:16,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2022-10-15 16:45:16,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2022-10-15 16:45:16,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2022-10-15 16:45:16,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2022-10-15 16:45:16,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2022-10-15 16:45:16,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2022-10-15 16:45:16,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2022-10-15 16:45:16,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2022-10-15 16:45:16,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2022-10-15 16:45:16,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2022-10-15 16:45:16,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2022-10-15 16:45:16,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2022-10-15 16:45:16,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2022-10-15 16:45:16,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2022-10-15 16:45:16,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2022-10-15 16:45:16,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2022-10-15 16:45:16,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2022-10-15 16:45:16,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2022-10-15 16:45:16,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 68 remaining) [2022-10-15 16:45:16,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2022-10-15 16:45:16,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2022-10-15 16:45:16,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 68 remaining) [2022-10-15 16:45:16,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 68 remaining) [2022-10-15 16:45:16,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2022-10-15 16:45:16,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 68 remaining) [2022-10-15 16:45:16,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 68 remaining) [2022-10-15 16:45:16,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 68 remaining) [2022-10-15 16:45:16,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2022-10-15 16:45:16,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2022-10-15 16:45:16,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 68 remaining) [2022-10-15 16:45:16,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 68 remaining) [2022-10-15 16:45:16,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 68 remaining) [2022-10-15 16:45:16,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 68 remaining) [2022-10-15 16:45:16,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:16,702 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:16,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:16,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:16 BoogieIcfgContainer [2022-10-15 16:45:16,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:16,768 INFO L158 Benchmark]: Toolchain (without parser) took 5162.25ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 123.5MB in the beginning and 152.2MB in the end (delta: -28.7MB). Peak memory consumption was 94.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:16,769 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 151.0MB. Free memory was 122.1MB in the beginning and 122.0MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:16,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.51ms. Allocated memory is still 151.0MB. Free memory was 123.4MB in the beginning and 109.6MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:16,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.27ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 106.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:16,770 INFO L158 Benchmark]: Boogie Preprocessor took 64.74ms. Allocated memory is still 151.0MB. Free memory was 106.9MB in the beginning and 104.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:16,770 INFO L158 Benchmark]: RCFGBuilder took 1419.65ms. Allocated memory is still 151.0MB. Free memory was 104.0MB in the beginning and 102.2MB in the end (delta: 1.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:16,771 INFO L158 Benchmark]: TraceAbstraction took 2926.91ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 101.7MB in the beginning and 152.2MB in the end (delta: -50.5MB). Peak memory consumption was 72.2MB. Max. memory is 8.0GB. [2022-10-15 16:45:16,773 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.38ms. Allocated memory is still 151.0MB. Free memory was 122.1MB in the beginning and 122.0MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 646.51ms. Allocated memory is still 151.0MB. Free memory was 123.4MB in the beginning and 109.6MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.27ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 106.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.74ms. Allocated memory is still 151.0MB. Free memory was 106.9MB in the beginning and 104.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1419.65ms. Allocated memory is still 151.0MB. Free memory was 104.0MB in the beginning and 102.2MB in the end (delta: 1.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2926.91ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 101.7MB in the beginning and 152.2MB in the end (delta: -50.5MB). Peak memory consumption was 72.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 240]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 239, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of memtrack at line 240, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L234] float x = 0.0f; [L235] float y = 0.0f; [L236] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L125] ieee_float_shape_type gf_u; VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L126] gf_u.value = (x) VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L127] EXPR gf_u.word VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, gf_u.word=4294967296, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L131] ieee_float_shape_type gf_u; VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L132] gf_u.value = (y) VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L133] EXPR gf_u.word VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, gf_u.word=6442450943, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=0, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L236] RET, EXPR __ieee754_atan2f(y, x) [L236] float res = __ieee754_atan2f(y, x); [L239] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000011, res == 0.0f && __signbit_float(res) == 0=0, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] [L239] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L240] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000011, tiny_atan2=1/1000000000000000000000000000000, x=0, y=0, zero_atan2=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 229]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 221 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 3050 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1473 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1577 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 63 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-15 16:45:16,834 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...