/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_0682b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:10,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:10,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:10,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:10,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:10,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:10,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:10,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:10,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:10,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:10,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:10,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:10,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:10,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:10,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:10,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:10,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:10,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:10,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:10,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:10,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:10,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:10,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:10,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:11,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:11,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:11,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:11,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:11,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:11,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:11,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:11,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:11,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:11,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:11,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:11,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:11,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:11,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:11,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:11,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:11,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:11,023 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:11,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:11,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:11,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:11,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:11,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:11,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:11,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:11,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:11,085 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:11,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:11,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:11,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:11,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:11,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:11,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:11,087 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:11,087 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:11,088 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:11,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:11,088 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:11,088 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:11,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:11,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:11,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:11,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:11,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:11,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:11,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:11,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:11,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:11,090 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:11,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:11,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:11,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:11,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:11,531 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:11,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0682b.c [2022-10-15 16:45:11,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9a6cfec/259bdc7337f849bbb287a434ff5b7ca2/FLAG716b8e354 [2022-10-15 16:45:12,275 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:12,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0682b.c [2022-10-15 16:45:12,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9a6cfec/259bdc7337f849bbb287a434ff5b7ca2/FLAG716b8e354 [2022-10-15 16:45:12,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9a6cfec/259bdc7337f849bbb287a434ff5b7ca2 [2022-10-15 16:45:12,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:12,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:12,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:12,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:12,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:12,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41af35ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:12, skipping insertion in model container [2022-10-15 16:45:12,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:12" (1/1) ... [2022-10-15 16:45:12,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:12,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:13,030 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_0682b.c[5566,5579] [2022-10-15 16:45:13,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:13,067 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:13,171 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_0682b.c[5566,5579] [2022-10-15 16:45:13,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:13,196 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:13,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:13 WrapperNode [2022-10-15 16:45:13,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:13,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:13,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:13,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:13,208 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:13" (1/1) ... [2022-10-15 16:45:13,223 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:13" (1/1) ... [2022-10-15 16:45:13,263 INFO L138 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 274 [2022-10-15 16:45:13,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:13,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:13,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:13,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:13,277 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:13" (1/1) ... [2022-10-15 16:45:13,277 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:13" (1/1) ... [2022-10-15 16:45:13,283 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:13" (1/1) ... [2022-10-15 16:45:13,284 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:13" (1/1) ... [2022-10-15 16:45:13,306 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:13" (1/1) ... [2022-10-15 16:45:13,323 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:13" (1/1) ... [2022-10-15 16:45:13,329 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:13" (1/1) ... [2022-10-15 16:45:13,336 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:13" (1/1) ... [2022-10-15 16:45:13,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:13,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:13,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:13,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:13,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:13" (1/1) ... [2022-10-15 16:45:13,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:13,398 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:13,416 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:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-10-15 16:45:13,479 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-10-15 16:45:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:13,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-10-15 16:45:13,480 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-10-15 16:45:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:13,610 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:13,613 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:14,575 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:14,593 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:14,593 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 16:45:14,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:14 BoogieIcfgContainer [2022-10-15 16:45:14,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:14,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:14,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:14,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:14,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:12" (1/3) ... [2022-10-15 16:45:14,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f7c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:14, skipping insertion in model container [2022-10-15 16:45:14,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:13" (2/3) ... [2022-10-15 16:45:14,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f7c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:14, skipping insertion in model container [2022-10-15 16:45:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:14" (3/3) ... [2022-10-15 16:45:14,611 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0682b.c [2022-10-15 16:45:14,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:14,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2022-10-15 16:45:14,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:14,746 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;@34b46ccd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:14,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2022-10-15 16:45:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 147 states have (on average 1.9523809523809523) internal successors, (287), 215 states have internal predecessors, (287), 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,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:14,780 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:14,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:14,782 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,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2156997, now seen corresponding path program 1 times [2022-10-15 16:45:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:14,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44513279] [2022-10-15 16:45:14,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:14,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:15,111 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,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:15,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44513279] [2022-10-15 16:45:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44513279] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:15,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:15,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:15,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78431198] [2022-10-15 16:45:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:15,158 INFO L87 Difference]: Start difference. First operand has 222 states, 147 states have (on average 1.9523809523809523) internal successors, (287), 215 states have internal predecessors, (287), 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:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:15,418 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2022-10-15 16:45:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:15,421 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,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:15,448 INFO L225 Difference]: With dead ends: 220 [2022-10-15 16:45:15,448 INFO L226 Difference]: Without dead ends: 218 [2022-10-15 16:45:15,450 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,456 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 449 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:15,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 449 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:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-10-15 16:45:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-10-15 16:45:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 146 states have (on average 1.7808219178082192) internal successors, (260), 211 states have internal predecessors, (260), 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 268 transitions. [2022-10-15 16:45:15,525 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 268 transitions. Word has length 4 [2022-10-15 16:45:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:15,526 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 268 transitions. [2022-10-15 16:45:15,526 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,527 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 268 transitions. [2022-10-15 16:45:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:15,527 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:15,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:15,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:15,528 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:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2156998, now seen corresponding path program 1 times [2022-10-15 16:45:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:15,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462869206] [2022-10-15 16:45:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:15,725 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,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462869206] [2022-10-15 16:45:15,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462869206] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:15,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:15,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023292310] [2022-10-15 16:45:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:15,732 INFO L87 Difference]: Start difference. First operand 218 states and 268 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,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:15,906 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2022-10-15 16:45:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:15,907 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,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:15,910 INFO L225 Difference]: With dead ends: 216 [2022-10-15 16:45:15,910 INFO L226 Difference]: Without dead ends: 216 [2022-10-15 16:45:15,910 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,913 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 2 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 454 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,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 454 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,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-10-15 16:45:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-10-15 16:45:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 146 states have (on average 1.7671232876712328) internal successors, (258), 209 states have internal predecessors, (258), 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,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2022-10-15 16:45:15,954 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 4 [2022-10-15 16:45:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:15,955 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2022-10-15 16:45:15,955 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,955 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2022-10-15 16:45:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:15,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:15,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:15,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:15,957 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,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1342043793, now seen corresponding path program 1 times [2022-10-15 16:45:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:15,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936898031] [2022-10-15 16:45:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,059 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,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936898031] [2022-10-15 16:45:16,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936898031] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378114723] [2022-10-15 16:45:16,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:16,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:16,065 INFO L87 Difference]: Start difference. First operand 216 states and 266 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,174 INFO L93 Difference]: Finished difference Result 214 states and 264 transitions. [2022-10-15 16:45:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:16,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-10-15 16:45:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,177 INFO L225 Difference]: With dead ends: 214 [2022-10-15 16:45:16,177 INFO L226 Difference]: Without dead ends: 214 [2022-10-15 16:45:16,177 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,179 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 439 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-10-15 16:45:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-10-15 16:45:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 146 states have (on average 1.7534246575342465) internal successors, (256), 207 states have internal predecessors, (256), 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,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 264 transitions. [2022-10-15 16:45:16,196 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 264 transitions. Word has length 12 [2022-10-15 16:45:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,197 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 264 transitions. [2022-10-15 16:45:16,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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,197 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2022-10-15 16:45:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:16,198 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:16,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:16,199 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:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1342043794, now seen corresponding path program 1 times [2022-10-15 16:45:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105058495] [2022-10-15 16:45:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,392 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,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105058495] [2022-10-15 16:45:16,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105058495] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698595022] [2022-10-15 16:45:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:16,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:16,395 INFO L87 Difference]: Start difference. First operand 214 states and 264 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,504 INFO L93 Difference]: Finished difference Result 212 states and 262 transitions. [2022-10-15 16:45:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:16,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-10-15 16:45:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,507 INFO L225 Difference]: With dead ends: 212 [2022-10-15 16:45:16,507 INFO L226 Difference]: Without dead ends: 212 [2022-10-15 16:45:16,507 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,519 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 448 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,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 448 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,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-10-15 16:45:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-10-15 16:45:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 205 states have internal predecessors, (254), 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,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 262 transitions. [2022-10-15 16:45:16,556 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 262 transitions. Word has length 12 [2022-10-15 16:45:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,559 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 262 transitions. [2022-10-15 16:45:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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,560 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 262 transitions. [2022-10-15 16:45:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:16,560 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:16,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:16,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1342349573, now seen corresponding path program 1 times [2022-10-15 16:45:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581508653] [2022-10-15 16:45:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,843 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,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581508653] [2022-10-15 16:45:16,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581508653] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70039362] [2022-10-15 16:45:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:16,849 INFO L87 Difference]: Start difference. First operand 212 states and 262 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,010 INFO L93 Difference]: Finished difference Result 214 states and 263 transitions. [2022-10-15 16:45:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:17,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-10-15 16:45:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,013 INFO L225 Difference]: With dead ends: 214 [2022-10-15 16:45:17,013 INFO L226 Difference]: Without dead ends: 212 [2022-10-15 16:45:17,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:17,016 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 1 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 614 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-10-15 16:45:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-10-15 16:45:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 146 states have (on average 1.7328767123287672) internal successors, (253), 205 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:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2022-10-15 16:45:17,039 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 12 [2022-10-15 16:45:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,040 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2022-10-15 16:45:17,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2022-10-15 16:45:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:17,052 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:17,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:17,054 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash 555486396, now seen corresponding path program 1 times [2022-10-15 16:45:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115591590] [2022-10-15 16:45:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,258 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:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115591590] [2022-10-15 16:45:17,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115591590] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079738122] [2022-10-15 16:45:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:17,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:17,261 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,367 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2022-10-15 16:45:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:17,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-15 16:45:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,370 INFO L225 Difference]: With dead ends: 210 [2022-10-15 16:45:17,370 INFO L226 Difference]: Without dead ends: 210 [2022-10-15 16:45:17,371 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:17,374 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 431 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-10-15 16:45:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-10-15 16:45:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 146 states have (on average 1.7191780821917808) internal successors, (251), 203 states have internal predecessors, (251), 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:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 259 transitions. [2022-10-15 16:45:17,386 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 259 transitions. Word has length 18 [2022-10-15 16:45:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,394 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 259 transitions. [2022-10-15 16:45:17,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2022-10-15 16:45:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:17,398 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:17,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:17,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-10-15 16:45:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 555486397, now seen corresponding path program 1 times [2022-10-15 16:45:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251574305] [2022-10-15 16:45:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,525 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:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251574305] [2022-10-15 16:45:17,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251574305] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042882043] [2022-10-15 16:45:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:17,528 INFO L87 Difference]: Start difference. First operand 210 states and 259 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,640 INFO L93 Difference]: Finished difference Result 208 states and 257 transitions. [2022-10-15 16:45:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-15 16:45:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,644 INFO L225 Difference]: With dead ends: 208 [2022-10-15 16:45:17,644 INFO L226 Difference]: Without dead ends: 208 [2022-10-15 16:45:17,645 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:17,647 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 2 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 440 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-10-15 16:45:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-10-15 16:45:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 146 states have (on average 1.7054794520547945) internal successors, (249), 201 states have internal predecessors, (249), 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:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 257 transitions. [2022-10-15 16:45:17,657 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 257 transitions. Word has length 18 [2022-10-15 16:45:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,658 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 257 transitions. [2022-10-15 16:45:17,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 257 transitions. [2022-10-15 16:45:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:45:17,660 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:17,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:17,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,662 INFO L85 PathProgramCache]: Analyzing trace with hash 228302015, now seen corresponding path program 1 times [2022-10-15 16:45:17,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790584447] [2022-10-15 16:45:17,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,809 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:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790584447] [2022-10-15 16:45:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790584447] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946220269] [2022-10-15 16:45:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:17,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:17,812 INFO L87 Difference]: Start difference. First operand 208 states and 257 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,867 INFO L93 Difference]: Finished difference Result 259 states and 327 transitions. [2022-10-15 16:45:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2022-10-15 16:45:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,870 INFO L225 Difference]: With dead ends: 259 [2022-10-15 16:45:17,871 INFO L226 Difference]: Without dead ends: 259 [2022-10-15 16:45:17,871 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:17,872 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 87 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 535 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-10-15 16:45:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 238. [2022-10-15 16:45:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 176 states have (on average 1.6875) internal successors, (297), 231 states have internal predecessors, (297), 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:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-10-15 16:45:17,891 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 26 [2022-10-15 16:45:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,893 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-10-15 16:45:17,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-10-15 16:45:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:45:17,894 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:17,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:17,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 221464525, now seen corresponding path program 1 times [2022-10-15 16:45:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839734289] [2022-10-15 16:45:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,976 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:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839734289] [2022-10-15 16:45:17,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839734289] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778195700] [2022-10-15 16:45:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:17,980 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,017 INFO L93 Difference]: Finished difference Result 245 states and 306 transitions. [2022-10-15 16:45:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2022-10-15 16:45:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,020 INFO L225 Difference]: With dead ends: 245 [2022-10-15 16:45:18,020 INFO L226 Difference]: Without dead ends: 245 [2022-10-15 16:45:18,021 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:18,024 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 34 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 490 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:18,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 490 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:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-10-15 16:45:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2022-10-15 16:45:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 174 states have (on average 1.660919540229885) internal successors, (289), 229 states have internal predecessors, (289), 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:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 297 transitions. [2022-10-15 16:45:18,034 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 297 transitions. Word has length 28 [2022-10-15 16:45:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,036 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 297 transitions. [2022-10-15 16:45:18,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 297 transitions. [2022-10-15 16:45:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:45:18,042 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:45:18,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -325706785, now seen corresponding path program 1 times [2022-10-15 16:45:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062572871] [2022-10-15 16:45:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:18,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:18,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:18,231 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:18,232 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (67 of 68 remaining) [2022-10-15 16:45:18,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 68 remaining) [2022-10-15 16:45:18,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 68 remaining) [2022-10-15 16:45:18,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 68 remaining) [2022-10-15 16:45:18,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 68 remaining) [2022-10-15 16:45:18,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 68 remaining) [2022-10-15 16:45:18,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 68 remaining) [2022-10-15 16:45:18,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 68 remaining) [2022-10-15 16:45:18,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 68 remaining) [2022-10-15 16:45:18,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 68 remaining) [2022-10-15 16:45:18,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 68 remaining) [2022-10-15 16:45:18,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 68 remaining) [2022-10-15 16:45:18,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 68 remaining) [2022-10-15 16:45:18,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 68 remaining) [2022-10-15 16:45:18,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 68 remaining) [2022-10-15 16:45:18,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 68 remaining) [2022-10-15 16:45:18,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 68 remaining) [2022-10-15 16:45:18,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 68 remaining) [2022-10-15 16:45:18,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 68 remaining) [2022-10-15 16:45:18,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 68 remaining) [2022-10-15 16:45:18,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 68 remaining) [2022-10-15 16:45:18,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 68 remaining) [2022-10-15 16:45:18,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 68 remaining) [2022-10-15 16:45:18,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 68 remaining) [2022-10-15 16:45:18,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 68 remaining) [2022-10-15 16:45:18,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 68 remaining) [2022-10-15 16:45:18,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 68 remaining) [2022-10-15 16:45:18,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 68 remaining) [2022-10-15 16:45:18,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 68 remaining) [2022-10-15 16:45:18,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (38 of 68 remaining) [2022-10-15 16:45:18,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 68 remaining) [2022-10-15 16:45:18,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 68 remaining) [2022-10-15 16:45:18,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 68 remaining) [2022-10-15 16:45:18,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 68 remaining) [2022-10-15 16:45:18,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 68 remaining) [2022-10-15 16:45:18,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 68 remaining) [2022-10-15 16:45:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 68 remaining) [2022-10-15 16:45:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 68 remaining) [2022-10-15 16:45:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 68 remaining) [2022-10-15 16:45:18,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 68 remaining) [2022-10-15 16:45:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 68 remaining) [2022-10-15 16:45:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 68 remaining) [2022-10-15 16:45:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 68 remaining) [2022-10-15 16:45:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 68 remaining) [2022-10-15 16:45:18,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 68 remaining) [2022-10-15 16:45:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 68 remaining) [2022-10-15 16:45:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 68 remaining) [2022-10-15 16:45:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 68 remaining) [2022-10-15 16:45:18,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 68 remaining) [2022-10-15 16:45:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 68 remaining) [2022-10-15 16:45:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 68 remaining) [2022-10-15 16:45:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 68 remaining) [2022-10-15 16:45:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 68 remaining) [2022-10-15 16:45:18,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 68 remaining) [2022-10-15 16:45:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 68 remaining) [2022-10-15 16:45:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 68 remaining) [2022-10-15 16:45:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 68 remaining) [2022-10-15 16:45:18,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 68 remaining) [2022-10-15 16:45:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 68 remaining) [2022-10-15 16:45:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 68 remaining) [2022-10-15 16:45:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 68 remaining) [2022-10-15 16:45:18,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 68 remaining) [2022-10-15 16:45:18,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 68 remaining) [2022-10-15 16:45:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 68 remaining) [2022-10-15 16:45:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 68 remaining) [2022-10-15 16:45:18,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 68 remaining) [2022-10-15 16:45:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 68 remaining) [2022-10-15 16:45:18,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 68 remaining) [2022-10-15 16:45:18,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:45:18,262 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:18,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:18,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:18 BoogieIcfgContainer [2022-10-15 16:45:18,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:18,375 INFO L158 Benchmark]: Toolchain (without parser) took 5734.38ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 126.5MB in the beginning and 141.2MB in the end (delta: -14.7MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-10-15 16:45:18,376 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:18,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.30ms. Allocated memory is still 153.1MB. Free memory was 126.4MB in the beginning and 112.5MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:18,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.34ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 109.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:18,377 INFO L158 Benchmark]: Boogie Preprocessor took 85.79ms. Allocated memory is still 153.1MB. Free memory was 109.8MB in the beginning and 107.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:18,378 INFO L158 Benchmark]: RCFGBuilder took 1246.33ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 102.3MB in the end (delta: 4.5MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-10-15 16:45:18,379 INFO L158 Benchmark]: TraceAbstraction took 3773.03ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 101.8MB in the beginning and 141.2MB in the end (delta: -39.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:18,381 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.29ms. Allocated memory is still 153.1MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.30ms. Allocated memory is still 153.1MB. Free memory was 126.4MB in the beginning and 112.5MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.34ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 109.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.79ms. Allocated memory is still 153.1MB. Free memory was 109.8MB in the beginning and 107.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1246.33ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 102.3MB in the end (delta: 4.5MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3773.03ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 101.8MB in the beginning and 141.2MB in the end (delta: -39.4MB). There was no memory consumed. 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: 244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 243, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 225, overapproximation of memtrack at line 244, 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] [L236] float x = -1.0f / 0.0f; [L237] float y = __VERIFIER_nondet_float(); [L239] CALL, EXPR isfinite_float(y) [L219] __int32_t ix; VAL [\old(x)=1000000000000000000000000000001, 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=1000000000000000000000000000001, zero_atan2=0] [L221] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000001, 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=1000000000000000000000000000001, zero_atan2=0] [L222] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000001, 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=1000000000000000000000000000001, zero_atan2=0] [L223] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, gf_u.word=8589934590, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L223] (ix) = gf_u.word [L225] ix &= 0x7fffffff [L226] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=2139095039, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L239] RET, EXPR isfinite_float(y) [L239] COND TRUE isfinite_float(y) && y > 0.0f [L240] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={10: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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L126] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={10: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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L127] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={10: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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L132] gf_u.value = (y) VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L133] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, gf_u.word=4294967295, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=-1, ix=0, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=-1, ix=0, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L240] RET, EXPR __ieee754_atan2f(y, x) [L240] float res = __ieee754_atan2f(y, x); [L243] COND TRUE res != pi 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, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L244] reach_error() 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, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, 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, 222 locations, 68 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 4300 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1974 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 678 IncrementalHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2326 mSDtfsCounter, 678 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, InterpolantAutomatonStates: 29, 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, 9 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:18,452 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...