/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/double_req_bl_0681b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:43:43,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:43:43,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:43:43,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:43:43,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:43:43,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:43:43,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:43:43,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:43:43,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:43:43,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:43:43,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:43:43,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:43:43,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:43:43,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:43:43,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:43:43,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:43:43,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:43:43,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:43:43,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:43:43,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:43:43,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:43:43,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:43:43,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:43:43,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:43:43,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:43:43,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:43:43,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:43:43,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:43:43,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:43:43,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:43:43,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:43:43,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:43:43,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:43:43,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:43:43,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:43:43,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:43:43,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:43:43,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:43:43,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:43:43,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:43:43,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:43:43,615 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:43:43,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:43:43,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:43:43,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:43:43,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:43:43,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:43:43,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:43:43,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:43:43,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:43:43,650 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:43:43,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:43:43,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:43:43,651 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:43:43,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:43:43,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:43:43,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:43:43,652 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:43:43,652 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:43:43,652 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:43:43,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:43:43,655 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:43:43,655 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:43:43,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:43:43,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:43:43,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:43:43,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:43:43,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:43,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:43:43,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:43:43,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:43:43,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:43:43,658 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:43:44,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:43:44,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:43:44,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:43:44,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:43:44,193 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:43:44,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0681b.c [2022-10-15 16:43:44,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c279c0aaa/2dc72bf25993466eb8ed129774ae8152/FLAG9ae8faa29 [2022-10-15 16:43:44,966 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:43:44,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0681b.c [2022-10-15 16:43:44,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c279c0aaa/2dc72bf25993466eb8ed129774ae8152/FLAG9ae8faa29 [2022-10-15 16:43:45,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c279c0aaa/2dc72bf25993466eb8ed129774ae8152 [2022-10-15 16:43:45,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:43:45,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:43:45,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:45,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:43:45,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:43:45,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c29601f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45, skipping insertion in model container [2022-10-15 16:43:45,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:43:45,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:43:45,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0681b.c[6391,6404] [2022-10-15 16:43:45,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:45,693 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:43:45,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0681b.c[6391,6404] [2022-10-15 16:43:45,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:45,786 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:43:45,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45 WrapperNode [2022-10-15 16:43:45,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:45,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:45,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:43:45,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:43:45,797 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:43:45" (1/1) ... [2022-10-15 16:43:45,814 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:43:45" (1/1) ... [2022-10-15 16:43:45,872 INFO L138 Inliner]: procedures = 20, calls = 92, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 285 [2022-10-15 16:43:45,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:45,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:43:45,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:43:45,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:43:45,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,983 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:45,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:46,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:43:46,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:43:46,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:43:46,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:43:46,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (1/1) ... [2022-10-15 16:43:46,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:43:46,075 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:43:46,100 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:43:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:43:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:43:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:43:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:43:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:43:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-10-15 16:43:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-10-15 16:43:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:43:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-10-15 16:43:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-10-15 16:43:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:43:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:43:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:43:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:43:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:43:46,370 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:43:46,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:43:47,274 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:43:47,291 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:43:47,291 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-10-15 16:43:47,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:47 BoogieIcfgContainer [2022-10-15 16:43:47,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:43:47,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:43:47,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:43:47,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:43:47,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:43:45" (1/3) ... [2022-10-15 16:43:47,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1434373a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:47, skipping insertion in model container [2022-10-15 16:43:47,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:45" (2/3) ... [2022-10-15 16:43:47,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1434373a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:47, skipping insertion in model container [2022-10-15 16:43:47,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:47" (3/3) ... [2022-10-15 16:43:47,307 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0681b.c [2022-10-15 16:43:47,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:43:47,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-10-15 16:43:47,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:43:47,415 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;@2dd0e442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:43:47,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-10-15 16:43:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 157 states have (on average 1.980891719745223) internal successors, (311), 237 states have internal predecessors, (311), 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:43:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:47,429 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:47,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:47,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 7667333, now seen corresponding path program 1 times [2022-10-15 16:43:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:47,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042290789] [2022-10-15 16:43:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:47,739 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:43:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042290789] [2022-10-15 16:43:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042290789] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:47,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:47,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150537757] [2022-10-15 16:43:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:47,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:47,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:47,792 INFO L87 Difference]: Start difference. First operand has 244 states, 157 states have (on average 1.980891719745223) internal successors, (311), 237 states have internal predecessors, (311), 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:43:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:48,097 INFO L93 Difference]: Finished difference Result 241 states and 291 transitions. [2022-10-15 16:43:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:48,100 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:43:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:48,116 INFO L225 Difference]: With dead ends: 241 [2022-10-15 16:43:48,117 INFO L226 Difference]: Without dead ends: 239 [2022-10-15 16:43:48,119 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:43:48,124 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 7 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:48,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 474 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-10-15 16:43:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-10-15 16:43:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 156 states have (on average 1.8012820512820513) internal successors, (281), 232 states have internal predecessors, (281), 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:43:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 289 transitions. [2022-10-15 16:43:48,197 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 289 transitions. Word has length 4 [2022-10-15 16:43:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:48,198 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 289 transitions. [2022-10-15 16:43:48,198 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:43:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 289 transitions. [2022-10-15 16:43:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:48,199 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:48,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:48,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:43:48,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash 7667334, now seen corresponding path program 1 times [2022-10-15 16:43:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:48,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849552719] [2022-10-15 16:43:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:48,423 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:43:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:48,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849552719] [2022-10-15 16:43:48,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849552719] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:48,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:48,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305050449] [2022-10-15 16:43:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:48,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:48,432 INFO L87 Difference]: Start difference. First operand 239 states and 289 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:43:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:48,647 INFO L93 Difference]: Finished difference Result 236 states and 286 transitions. [2022-10-15 16:43:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:48,648 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:43:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:48,650 INFO L225 Difference]: With dead ends: 236 [2022-10-15 16:43:48,650 INFO L226 Difference]: Without dead ends: 236 [2022-10-15 16:43:48,651 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:43:48,653 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:48,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 480 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-10-15 16:43:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-10-15 16:43:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 156 states have (on average 1.7820512820512822) internal successors, (278), 229 states have internal predecessors, (278), 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:43:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 286 transitions. [2022-10-15 16:43:48,675 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 286 transitions. Word has length 4 [2022-10-15 16:43:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:48,675 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 286 transitions. [2022-10-15 16:43:48,675 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:43:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 286 transitions. [2022-10-15 16:43:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:43:48,676 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:48,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:48,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:43:48,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash 502971987, now seen corresponding path program 1 times [2022-10-15 16:43:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:48,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940965363] [2022-10-15 16:43:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:48,802 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:43:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940965363] [2022-10-15 16:43:48,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940965363] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:48,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:48,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378379766] [2022-10-15 16:43:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:48,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:48,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:48,808 INFO L87 Difference]: Start difference. First operand 236 states and 286 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:43:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:48,962 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2022-10-15 16:43:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:48,963 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:43:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:48,965 INFO L225 Difference]: With dead ends: 233 [2022-10-15 16:43:48,965 INFO L226 Difference]: Without dead ends: 233 [2022-10-15 16:43:48,966 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:43:48,968 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:48,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 462 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-15 16:43:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-10-15 16:43:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 156 states have (on average 1.7628205128205128) internal successors, (275), 226 states have internal predecessors, (275), 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:43:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 283 transitions. [2022-10-15 16:43:48,984 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 283 transitions. Word has length 12 [2022-10-15 16:43:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:48,984 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 283 transitions. [2022-10-15 16:43:48,985 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:43:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 283 transitions. [2022-10-15 16:43:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:43:48,985 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:48,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:48,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:43:48,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:48,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash 502971988, now seen corresponding path program 1 times [2022-10-15 16:43:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:48,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338447443] [2022-10-15 16:43:48,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:49,135 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:43:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:49,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338447443] [2022-10-15 16:43:49,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338447443] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:49,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:49,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593570477] [2022-10-15 16:43:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:49,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:49,143 INFO L87 Difference]: Start difference. First operand 233 states and 283 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:43:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:49,274 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2022-10-15 16:43:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:49,275 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:43:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:49,278 INFO L225 Difference]: With dead ends: 230 [2022-10-15 16:43:49,278 INFO L226 Difference]: Without dead ends: 230 [2022-10-15 16:43:49,278 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:43:49,291 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 4 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:49,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 471 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-10-15 16:43:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-10-15 16:43:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 156 states have (on average 1.7435897435897436) internal successors, (272), 223 states have internal predecessors, (272), 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:43:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 280 transitions. [2022-10-15 16:43:49,322 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 280 transitions. Word has length 12 [2022-10-15 16:43:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:49,322 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 280 transitions. [2022-10-15 16:43:49,322 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:43:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 280 transitions. [2022-10-15 16:43:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:43:49,324 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:49,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:49,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:43:49,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1158386819, now seen corresponding path program 1 times [2022-10-15 16:43:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:49,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816824031] [2022-10-15 16:43:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:49,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:49,614 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:43:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:49,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816824031] [2022-10-15 16:43:49,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816824031] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:49,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:49,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057050815] [2022-10-15 16:43:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:49,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:49,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:49,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:49,618 INFO L87 Difference]: Start difference. First operand 230 states and 280 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:49,774 INFO L93 Difference]: Finished difference Result 228 states and 278 transitions. [2022-10-15 16:43:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:43:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:49,778 INFO L225 Difference]: With dead ends: 228 [2022-10-15 16:43:49,778 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 16:43:49,778 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:43:49,785 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:49,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 457 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 16:43:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-10-15 16:43:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 221 states have internal predecessors, (270), 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:43:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 278 transitions. [2022-10-15 16:43:49,796 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 278 transitions. Word has length 23 [2022-10-15 16:43:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:49,798 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 278 transitions. [2022-10-15 16:43:49,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 278 transitions. [2022-10-15 16:43:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:43:49,809 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:49,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:49,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:43:49,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1158386818, now seen corresponding path program 1 times [2022-10-15 16:43:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:49,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164288440] [2022-10-15 16:43:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:50,089 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:43:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:50,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164288440] [2022-10-15 16:43:50,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164288440] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:50,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:50,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992042907] [2022-10-15 16:43:50,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:50,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:50,092 INFO L87 Difference]: Start difference. First operand 228 states and 278 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:50,222 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2022-10-15 16:43:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:50,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:43:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:50,225 INFO L225 Difference]: With dead ends: 226 [2022-10-15 16:43:50,225 INFO L226 Difference]: Without dead ends: 226 [2022-10-15 16:43:50,225 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:43:50,226 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 2 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:50,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 467 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-10-15 16:43:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-10-15 16:43:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 156 states have (on average 1.7179487179487178) internal successors, (268), 219 states have internal predecessors, (268), 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:43:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 276 transitions. [2022-10-15 16:43:50,235 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 276 transitions. Word has length 23 [2022-10-15 16:43:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:50,235 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 276 transitions. [2022-10-15 16:43:50,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 276 transitions. [2022-10-15 16:43:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:43:50,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:50,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:50,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:43:50,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-10-15 16:43:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1158362988, now seen corresponding path program 1 times [2022-10-15 16:43:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:50,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054125872] [2022-10-15 16:43:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:50,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:43:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:50,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:43:50,467 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:43:50,468 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2022-10-15 16:43:50,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-10-15 16:43:50,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-10-15 16:43:50,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2022-10-15 16:43:50,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-10-15 16:43:50,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-10-15 16:43:50,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-10-15 16:43:50,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-10-15 16:43:50,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-10-15 16:43:50,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-10-15 16:43:50,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-10-15 16:43:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-10-15 16:43:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-10-15 16:43:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-10-15 16:43:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-10-15 16:43:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-10-15 16:43:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-10-15 16:43:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-10-15 16:43:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-10-15 16:43:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-10-15 16:43:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2022-10-15 16:43:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-10-15 16:43:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-10-15 16:43:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-10-15 16:43:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-10-15 16:43:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-10-15 16:43:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-10-15 16:43:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2022-10-15 16:43:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2022-10-15 16:43:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-10-15 16:43:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-10-15 16:43:50,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-10-15 16:43:50,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-10-15 16:43:50,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-10-15 16:43:50,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-10-15 16:43:50,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-10-15 16:43:50,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-10-15 16:43:50,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-10-15 16:43:50,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-10-15 16:43:50,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-10-15 16:43:50,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-10-15 16:43:50,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-10-15 16:43:50,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-10-15 16:43:50,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-10-15 16:43:50,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-10-15 16:43:50,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2022-10-15 16:43:50,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2022-10-15 16:43:50,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-10-15 16:43:50,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-10-15 16:43:50,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2022-10-15 16:43:50,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-10-15 16:43:50,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-10-15 16:43:50,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2022-10-15 16:43:50,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-10-15 16:43:50,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-10-15 16:43:50,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2022-10-15 16:43:50,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-10-15 16:43:50,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-10-15 16:43:50,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-10-15 16:43:50,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2022-10-15 16:43:50,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-10-15 16:43:50,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-10-15 16:43:50,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-10-15 16:43:50,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-10-15 16:43:50,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2022-10-15 16:43:50,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-10-15 16:43:50,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-10-15 16:43:50,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2022-10-15 16:43:50,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-10-15 16:43:50,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-10-15 16:43:50,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2022-10-15 16:43:50,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2022-10-15 16:43:50,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2022-10-15 16:43:50,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2022-10-15 16:43:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:43:50,508 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:50,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:43:50,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:43:50 BoogieIcfgContainer [2022-10-15 16:43:50,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:43:50,624 INFO L158 Benchmark]: Toolchain (without parser) took 5353.05ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 125.6MB in the beginning and 73.3MB in the end (delta: 52.3MB). Peak memory consumption was 84.0MB. Max. memory is 8.0GB. [2022-10-15 16:43:50,625 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 151.0MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:43:50,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.28ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 111.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:43:50,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.17ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 107.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:50,626 INFO L158 Benchmark]: Boogie Preprocessor took 133.99ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 103.9MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:43:50,626 INFO L158 Benchmark]: RCFGBuilder took 1283.43ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 95.8MB in the end (delta: 8.1MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-10-15 16:43:50,626 INFO L158 Benchmark]: TraceAbstraction took 3325.41ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 95.3MB in the beginning and 73.3MB in the end (delta: 22.0MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-10-15 16:43:50,631 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.37ms. Allocated memory is still 151.0MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 504.28ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 111.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.17ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 107.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 133.99ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 103.9MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1283.43ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 95.8MB in the end (delta: 8.1MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3325.41ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 95.3MB in the beginning and 73.3MB in the end (delta: 22.0MB). Peak memory consumption was 53.8MB. 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: 270]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 266, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of memtrack at line 270, overapproximation of someBinaryDOUBLEComparisonOperation at line 269. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L265] double x = 0.0; [L266] double y = -0.0; [L267] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L150] ieee_double_shape_type ew_u; VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L151] ew_u.value = (x) VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L152] EXPR ew_u.parts.msw VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, ew_u.parts.msw=8589934592, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, ew_u.parts.lsw=-2, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=-2, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L157] ieee_double_shape_type ew_u; VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=-2, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L158] ew_u.value = (y) VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=-2, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L159] EXPR ew_u.parts.msw VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, ew_u.parts.msw=4294967296, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=-2, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, ew_u.parts.lsw=10, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, lx=-2, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=-2, ly=10, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=0, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=-2, ly=10, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L267] RET, EXPR __ieee754_atan2(y, x) [L267] double res = __ieee754_atan2(y, x); [L269] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011, res == -0.0 && __signbit_double(res) == 1=0, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, zero_atan2=0] [L269] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L270] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012, 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: -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. - 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: 258]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 244 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 2811 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1147 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1664 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:43:50,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...