/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_0683a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:11,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:11,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:11,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:11,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:11,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:11,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:11,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:11,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:11,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:11,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:11,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:11,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:11,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:11,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:11,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:11,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:11,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:11,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:11,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:11,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:11,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:11,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:11,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:11,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:11,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:11,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:11,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:11,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:11,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:11,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:11,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:11,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:11,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:11,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:11,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:11,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:11,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:11,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:11,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:11,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:11,293 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,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:11,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:11,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:11,351 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:11,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:11,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:11,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:11,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:11,357 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:11,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:11,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:11,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:11,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:11,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:11,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:11,360 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:11,360 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:11,360 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:11,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:11,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:11,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:11,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:11,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:11,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:11,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:11,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:11,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:11,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:11,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:11,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:11,363 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,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:11,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:11,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:11,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:11,862 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:11,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0683a.c [2022-10-15 16:45:11,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f4707d8/d2cfd495d28c41ac9af8868bda8588f8/FLAGef4346a0a [2022-10-15 16:45:12,735 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:12,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0683a.c [2022-10-15 16:45:12,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f4707d8/d2cfd495d28c41ac9af8868bda8588f8/FLAGef4346a0a [2022-10-15 16:45:13,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f4707d8/d2cfd495d28c41ac9af8868bda8588f8 [2022-10-15 16:45:13,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:13,017 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:13,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:13,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:13,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:13,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:13" (1/1) ... [2022-10-15 16:45:13,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b0e653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:13, skipping insertion in model container [2022-10-15 16:45:13,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:13" (1/1) ... [2022-10-15 16:45:13,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:13,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:13,395 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_0683a.c[5826,5839] [2022-10-15 16:45:13,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:13,414 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:13,472 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_0683a.c[5826,5839] [2022-10-15 16:45:13,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:13,497 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:13,498 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,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:13,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:13,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:13,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:13,511 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,528 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,574 INFO L138 Inliner]: procedures = 21, calls = 89, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-10-15 16:45:13,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:13,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:13,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:13,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:13,591 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,592 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,610 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,610 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,660 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,669 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,673 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,676 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,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:13,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:13,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:13,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:13,685 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,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:13,732 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,744 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,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-10-15 16:45:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-10-15 16:45:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:13,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-10-15 16:45:13,828 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-10-15 16:45:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:14,070 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:14,077 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:15,089 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:15,113 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:15,113 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-10-15 16:45:15,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:15 BoogieIcfgContainer [2022-10-15 16:45:15,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:15,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:15,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:15,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:15,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:13" (1/3) ... [2022-10-15 16:45:15,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680a964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:15, skipping insertion in model container [2022-10-15 16:45:15,138 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:15,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680a964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:15, skipping insertion in model container [2022-10-15 16:45:15,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:15" (3/3) ... [2022-10-15 16:45:15,140 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0683a.c [2022-10-15 16:45:15,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:15,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-10-15 16:45:15,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:15,275 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;@7d462854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:15,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-10-15 16:45:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 155 states have (on average 1.9483870967741936) internal successors, (302), 227 states have internal predecessors, (302), 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,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:15,298 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:15,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:15,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2156997, now seen corresponding path program 1 times [2022-10-15 16:45:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336812584] [2022-10-15 16:45:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:15,705 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,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:15,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336812584] [2022-10-15 16:45:15,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336812584] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:15,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:15,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361527163] [2022-10-15 16:45:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:15,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:15,757 INFO L87 Difference]: Start difference. First operand has 234 states, 155 states have (on average 1.9483870967741936) internal successors, (302), 227 states have internal predecessors, (302), 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,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:15,972 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2022-10-15 16:45:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:15,975 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,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:15,990 INFO L225 Difference]: With dead ends: 232 [2022-10-15 16:45:15,990 INFO L226 Difference]: Without dead ends: 230 [2022-10-15 16:45:15,993 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,998 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 4 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 469 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-10-15 16:45:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-10-15 16:45:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.7727272727272727) internal successors, (273), 223 states have internal predecessors, (273), 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,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2022-10-15 16:45:16,080 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 4 [2022-10-15 16:45:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,081 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2022-10-15 16:45:16,081 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:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2022-10-15 16:45:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:16,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:16,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:16,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2156998, now seen corresponding path program 1 times [2022-10-15 16:45:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313132796] [2022-10-15 16:45:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,300 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,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313132796] [2022-10-15 16:45:16,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313132796] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707288747] [2022-10-15 16:45:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:16,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:16,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:16,306 INFO L87 Difference]: Start difference. First operand 230 states and 281 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:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,476 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-10-15 16:45:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:16,476 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:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,480 INFO L225 Difference]: With dead ends: 228 [2022-10-15 16:45:16,480 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 16:45:16,480 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,482 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 16:45:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-10-15 16:45:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 154 states have (on average 1.7597402597402598) internal successors, (271), 221 states have internal predecessors, (271), 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,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 279 transitions. [2022-10-15 16:45:16,503 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 279 transitions. Word has length 4 [2022-10-15 16:45:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,503 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 279 transitions. [2022-10-15 16:45:16,504 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:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2022-10-15 16:45:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:16,505 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:16,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:16,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1342043793, now seen corresponding path program 1 times [2022-10-15 16:45:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391514333] [2022-10-15 16:45:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:16,656 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,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:16,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391514333] [2022-10-15 16:45:16,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391514333] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:16,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:16,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221711359] [2022-10-15 16:45:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:16,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:16,660 INFO L87 Difference]: Start difference. First operand 228 states and 279 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,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:16,812 INFO L93 Difference]: Finished difference Result 226 states and 277 transitions. [2022-10-15 16:45:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:16,813 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,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:16,816 INFO L225 Difference]: With dead ends: 226 [2022-10-15 16:45:16,817 INFO L226 Difference]: Without dead ends: 226 [2022-10-15 16:45:16,818 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,826 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:16,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 459 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-10-15 16:45:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-10-15 16:45:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 154 states have (on average 1.7467532467532467) internal successors, (269), 219 states have internal predecessors, (269), 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,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2022-10-15 16:45:16,843 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 12 [2022-10-15 16:45:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:16,843 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2022-10-15 16:45:16,844 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,844 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2022-10-15 16:45:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:16,845 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:16,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:16,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:16,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1342043794, now seen corresponding path program 1 times [2022-10-15 16:45:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:16,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789948381] [2022-10-15 16:45:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,004 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,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789948381] [2022-10-15 16:45:17,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789948381] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553891490] [2022-10-15 16:45:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:17,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:17,012 INFO L87 Difference]: Start difference. First operand 226 states and 277 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:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,156 INFO L93 Difference]: Finished difference Result 224 states and 275 transitions. [2022-10-15 16:45:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:17,157 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:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,159 INFO L225 Difference]: With dead ends: 224 [2022-10-15 16:45:17,159 INFO L226 Difference]: Without dead ends: 224 [2022-10-15 16:45:17,159 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,168 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 469 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-10-15 16:45:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-10-15 16:45:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 154 states have (on average 1.7337662337662338) internal successors, (267), 217 states have internal predecessors, (267), 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,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2022-10-15 16:45:17,200 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2022-10-15 16:45:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,200 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2022-10-15 16:45:17,203 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:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2022-10-15 16:45:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:17,204 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:17,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1342377377, now seen corresponding path program 1 times [2022-10-15 16:45:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143227870] [2022-10-15 16:45:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,371 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,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143227870] [2022-10-15 16:45:17,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143227870] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616486375] [2022-10-15 16:45:17,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:17,377 INFO L87 Difference]: Start difference. First operand 224 states and 275 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,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,555 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2022-10-15 16:45:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:17,555 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,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,557 INFO L225 Difference]: With dead ends: 226 [2022-10-15 16:45:17,557 INFO L226 Difference]: Without dead ends: 224 [2022-10-15 16:45:17,558 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,559 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:45:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-10-15 16:45:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-10-15 16:45:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 154 states have (on average 1.7272727272727273) internal successors, (266), 217 states have internal predecessors, (266), 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,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2022-10-15 16:45:17,569 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 12 [2022-10-15 16:45:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,569 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2022-10-15 16:45:17,569 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,569 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2022-10-15 16:45:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:17,570 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,570 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,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:17,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 555486396, now seen corresponding path program 1 times [2022-10-15 16:45:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222823714] [2022-10-15 16:45:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,653 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,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222823714] [2022-10-15 16:45:17,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222823714] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157215536] [2022-10-15 16:45:17,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:17,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:17,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:17,656 INFO L87 Difference]: Start difference. First operand 224 states and 274 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,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,797 INFO L93 Difference]: Finished difference Result 222 states and 272 transitions. [2022-10-15 16:45:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:17,798 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,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,800 INFO L225 Difference]: With dead ends: 222 [2022-10-15 16:45:17,800 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 16:45:17,801 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,802 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 451 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 16:45:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-10-15 16:45:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 215 states have internal predecessors, (264), 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,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 272 transitions. [2022-10-15 16:45:17,835 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 272 transitions. Word has length 18 [2022-10-15 16:45:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:17,835 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 272 transitions. [2022-10-15 16:45:17,836 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,836 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 272 transitions. [2022-10-15 16:45:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:17,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,837 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,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:17,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 555486397, now seen corresponding path program 1 times [2022-10-15 16:45:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512905326] [2022-10-15 16:45:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,009 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:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512905326] [2022-10-15 16:45:18,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512905326] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709990260] [2022-10-15 16:45:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:18,014 INFO L87 Difference]: Start difference. First operand 222 states and 272 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:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,110 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2022-10-15 16:45:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,112 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:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,114 INFO L225 Difference]: With dead ends: 220 [2022-10-15 16:45:18,115 INFO L226 Difference]: Without dead ends: 220 [2022-10-15 16:45:18,115 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:18,117 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:18,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-15 16:45:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-10-15 16:45:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.7012987012987013) internal successors, (262), 213 states have internal predecessors, (262), 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,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2022-10-15 16:45:18,127 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 270 transitions. Word has length 18 [2022-10-15 16:45:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,131 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 270 transitions. [2022-10-15 16:45:18,131 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:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 270 transitions. [2022-10-15 16:45:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 16:45:18,134 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,134 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] [2022-10-15 16:45:18,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:18,134 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1512571659, now seen corresponding path program 1 times [2022-10-15 16:45:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083821994] [2022-10-15 16:45:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,254 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:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083821994] [2022-10-15 16:45:18,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083821994] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007979308] [2022-10-15 16:45:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:18,258 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,304 INFO L93 Difference]: Finished difference Result 295 states and 366 transitions. [2022-10-15 16:45:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:18,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-10-15 16:45:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,307 INFO L225 Difference]: With dead ends: 295 [2022-10-15 16:45:18,307 INFO L226 Difference]: Without dead ends: 295 [2022-10-15 16:45:18,308 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:18,308 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 89 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:18,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 798 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-10-15 16:45:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 250. [2022-10-15 16:45:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 184 states have (on average 1.684782608695652) internal successors, (310), 243 states have internal predecessors, (310), 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,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2022-10-15 16:45:18,320 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 27 [2022-10-15 16:45:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,320 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2022-10-15 16:45:18,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-10-15 16:45:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:45:18,322 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,322 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:18,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:18,323 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 222326477, now seen corresponding path program 1 times [2022-10-15 16:45:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068879613] [2022-10-15 16:45:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,389 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:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068879613] [2022-10-15 16:45:18,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068879613] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547627399] [2022-10-15 16:45:18,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:18,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:18,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:18,392 INFO L87 Difference]: Start difference. First operand 250 states and 318 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,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,429 INFO L93 Difference]: Finished difference Result 269 states and 332 transitions. [2022-10-15 16:45:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,430 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,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,432 INFO L225 Difference]: With dead ends: 269 [2022-10-15 16:45:18,432 INFO L226 Difference]: Without dead ends: 269 [2022-10-15 16:45:18,432 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,433 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 47 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 516 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,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 516 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,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-10-15 16:45:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248. [2022-10-15 16:45:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 182 states have (on average 1.6593406593406594) internal successors, (302), 241 states have internal predecessors, (302), 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,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2022-10-15 16:45:18,441 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 28 [2022-10-15 16:45:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,442 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2022-10-15 16:45:18,442 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,442 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2022-10-15 16:45:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:45:18,443 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,444 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, 1] [2022-10-15 16:45:18,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:45:18,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1506975275, now seen corresponding path program 1 times [2022-10-15 16:45:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69702299] [2022-10-15 16:45:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,529 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:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69702299] [2022-10-15 16:45:18,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69702299] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693134838] [2022-10-15 16:45:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:18,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:18,532 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,624 INFO L93 Difference]: Finished difference Result 246 states and 308 transitions. [2022-10-15 16:45:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-10-15 16:45:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,635 INFO L225 Difference]: With dead ends: 246 [2022-10-15 16:45:18,635 INFO L226 Difference]: Without dead ends: 246 [2022-10-15 16:45:18,635 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:18,636 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 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.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:18,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-15 16:45:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-10-15 16:45:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 182 states have (on average 1.6483516483516483) internal successors, (300), 239 states have internal predecessors, (300), 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,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 308 transitions. [2022-10-15 16:45:18,644 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 308 transitions. Word has length 30 [2022-10-15 16:45:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,645 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 308 transitions. [2022-10-15 16:45:18,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 308 transitions. [2022-10-15 16:45:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:45:18,646 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,646 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, 1] [2022-10-15 16:45:18,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:45:18,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1506975274, now seen corresponding path program 1 times [2022-10-15 16:45:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468780433] [2022-10-15 16:45:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,783 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:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468780433] [2022-10-15 16:45:18,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468780433] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877688290] [2022-10-15 16:45:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:18,786 INFO L87 Difference]: Start difference. First operand 246 states and 308 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,882 INFO L93 Difference]: Finished difference Result 244 states and 306 transitions. [2022-10-15 16:45:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-10-15 16:45:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,885 INFO L225 Difference]: With dead ends: 244 [2022-10-15 16:45:18,885 INFO L226 Difference]: Without dead ends: 244 [2022-10-15 16:45:18,885 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:18,886 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:18,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 455 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-15 16:45:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-10-15 16:45:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 182 states have (on average 1.6373626373626373) internal successors, (298), 237 states have internal predecessors, (298), 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,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 306 transitions. [2022-10-15 16:45:18,895 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 306 transitions. Word has length 30 [2022-10-15 16:45:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,896 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 306 transitions. [2022-10-15 16:45:18,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 306 transitions. [2022-10-15 16:45:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:45:18,897 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,897 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, 1] [2022-10-15 16:45:18,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:45:18,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1506951444, now seen corresponding path program 1 times [2022-10-15 16:45:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946614112] [2022-10-15 16:45:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:18,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:19,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:19,007 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:19,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (71 of 72 remaining) [2022-10-15 16:45:19,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 72 remaining) [2022-10-15 16:45:19,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 72 remaining) [2022-10-15 16:45:19,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 72 remaining) [2022-10-15 16:45:19,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 72 remaining) [2022-10-15 16:45:19,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 72 remaining) [2022-10-15 16:45:19,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 72 remaining) [2022-10-15 16:45:19,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 72 remaining) [2022-10-15 16:45:19,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 72 remaining) [2022-10-15 16:45:19,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 72 remaining) [2022-10-15 16:45:19,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 72 remaining) [2022-10-15 16:45:19,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 72 remaining) [2022-10-15 16:45:19,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 72 remaining) [2022-10-15 16:45:19,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 72 remaining) [2022-10-15 16:45:19,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 72 remaining) [2022-10-15 16:45:19,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 72 remaining) [2022-10-15 16:45:19,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 72 remaining) [2022-10-15 16:45:19,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 72 remaining) [2022-10-15 16:45:19,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 72 remaining) [2022-10-15 16:45:19,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 72 remaining) [2022-10-15 16:45:19,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 72 remaining) [2022-10-15 16:45:19,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 72 remaining) [2022-10-15 16:45:19,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 72 remaining) [2022-10-15 16:45:19,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 72 remaining) [2022-10-15 16:45:19,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 72 remaining) [2022-10-15 16:45:19,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 72 remaining) [2022-10-15 16:45:19,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 72 remaining) [2022-10-15 16:45:19,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 72 remaining) [2022-10-15 16:45:19,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 72 remaining) [2022-10-15 16:45:19,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 72 remaining) [2022-10-15 16:45:19,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 72 remaining) [2022-10-15 16:45:19,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 72 remaining) [2022-10-15 16:45:19,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 72 remaining) [2022-10-15 16:45:19,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (38 of 72 remaining) [2022-10-15 16:45:19,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 72 remaining) [2022-10-15 16:45:19,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 72 remaining) [2022-10-15 16:45:19,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 72 remaining) [2022-10-15 16:45:19,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 72 remaining) [2022-10-15 16:45:19,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 72 remaining) [2022-10-15 16:45:19,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 72 remaining) [2022-10-15 16:45:19,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 72 remaining) [2022-10-15 16:45:19,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 72 remaining) [2022-10-15 16:45:19,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 72 remaining) [2022-10-15 16:45:19,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 72 remaining) [2022-10-15 16:45:19,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 72 remaining) [2022-10-15 16:45:19,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 72 remaining) [2022-10-15 16:45:19,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 72 remaining) [2022-10-15 16:45:19,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 72 remaining) [2022-10-15 16:45:19,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 72 remaining) [2022-10-15 16:45:19,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 72 remaining) [2022-10-15 16:45:19,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 72 remaining) [2022-10-15 16:45:19,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 72 remaining) [2022-10-15 16:45:19,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 72 remaining) [2022-10-15 16:45:19,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 72 remaining) [2022-10-15 16:45:19,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 72 remaining) [2022-10-15 16:45:19,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 72 remaining) [2022-10-15 16:45:19,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 72 remaining) [2022-10-15 16:45:19,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 72 remaining) [2022-10-15 16:45:19,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 72 remaining) [2022-10-15 16:45:19,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 72 remaining) [2022-10-15 16:45:19,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 72 remaining) [2022-10-15 16:45:19,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 72 remaining) [2022-10-15 16:45:19,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 72 remaining) [2022-10-15 16:45:19,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 72 remaining) [2022-10-15 16:45:19,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 72 remaining) [2022-10-15 16:45:19,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 72 remaining) [2022-10-15 16:45:19,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 72 remaining) [2022-10-15 16:45:19,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 72 remaining) [2022-10-15 16:45:19,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 72 remaining) [2022-10-15 16:45:19,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 72 remaining) [2022-10-15 16:45:19,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 72 remaining) [2022-10-15 16:45:19,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 72 remaining) [2022-10-15 16:45:19,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:45:19,030 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:19,035 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:19,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:19 BoogieIcfgContainer [2022-10-15 16:45:19,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:19,099 INFO L158 Benchmark]: Toolchain (without parser) took 6087.23ms. Allocated memory was 158.3MB in the beginning and 191.9MB in the end (delta: 33.6MB). Free memory was 132.8MB in the beginning and 102.9MB in the end (delta: 29.9MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-10-15 16:45:19,099 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 158.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:19,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.77ms. Allocated memory is still 158.3MB. Free memory was 132.7MB in the beginning and 118.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:19,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.91ms. Allocated memory is still 158.3MB. Free memory was 118.1MB in the beginning and 115.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:19,100 INFO L158 Benchmark]: Boogie Preprocessor took 107.47ms. Allocated memory is still 158.3MB. Free memory was 115.1MB in the beginning and 112.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:19,101 INFO L158 Benchmark]: RCFGBuilder took 1437.37ms. Allocated memory is still 158.3MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-10-15 16:45:19,101 INFO L158 Benchmark]: TraceAbstraction took 3971.28ms. Allocated memory was 158.3MB in the beginning and 191.9MB in the end (delta: 33.6MB). Free memory was 110.0MB in the beginning and 102.9MB in the end (delta: 7.1MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:19,103 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.30ms. Allocated memory is still 158.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.77ms. Allocated memory is still 158.3MB. Free memory was 132.7MB in the beginning and 118.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.91ms. Allocated memory is still 158.3MB. Free memory was 118.1MB in the beginning and 115.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 107.47ms. Allocated memory is still 158.3MB. Free memory was 115.1MB in the beginning and 112.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1437.37ms. Allocated memory is still 158.3MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3971.28ms. Allocated memory was 158.3MB in the beginning and 191.9MB in the end (delta: 33.6MB). Free memory was 110.0MB in the beginning and 102.9MB in the end (delta: 7.1MB). Peak memory consumption was 40.7MB. 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: 257]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 256, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 237, overapproximation of memtrack at line 257, 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] [L249] float x = 1.0f / 0.0f; [L250] float y = __VERIFIER_nondet_float(); [L252] CALL, EXPR isfinite_float(y) [L231] __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] [L233] 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] [L234] 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] [L235] 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] [L235] (ix) = gf_u.word [L237] ix &= 0x7fffffff [L238] 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] [L252] RET, EXPR isfinite_float(y) [L252] COND TRUE isfinite_float(y) && y < 0.0f [L253] 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] [L253] RET, EXPR __ieee754_atan2f(y, x) [L253] float res = __ieee754_atan2f(y, x); [L256] EXPR res == -0.0f && __signbit_float(res) == 1 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, res == -0.0f && __signbit_float(res) == 1=0, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L256] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L257] 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: -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: 241]: 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, 234 locations, 72 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 5639 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2657 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 895 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2982 mSDtfsCounter, 895 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=8, InterpolantAutomatonStates: 35, 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, 11 MinimizatonAttempts, 66 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:45:19,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...