/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_0270a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:16:43,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:16:43,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:16:43,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:16:43,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:16:43,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:16:43,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:16:43,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:16:43,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:16:43,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:16:43,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:16:43,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:16:43,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:16:43,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:16:43,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:16:43,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:16:43,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:16:43,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:16:43,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:16:43,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:16:43,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:16:43,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:16:43,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:16:43,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:16:43,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:16:43,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:16:43,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:16:43,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:16:43,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:16:43,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:16:43,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:16:43,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:16:43,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:16:43,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:16:43,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:16:43,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:16:43,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:16:43,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:16:43,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:16:43,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:16:43,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:16:43,926 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-16 01:16:43,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:16:43,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:16:43,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:16:43,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:16:43,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:16:43,988 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:16:43,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:16:43,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:16:43,992 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:16:43,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:16:43,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:16:43,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:16:43,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:16:43,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:16:43,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:16:43,995 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:16:43,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:16:43,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:16:43,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:16:43,996 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:16:43,996 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:16:43,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:16:43,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:16:43,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:16:43,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:16:43,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:16:43,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:16:43,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:16:43,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:16:43,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:16:43,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 01:16:44,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:16:44,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:16:44,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:16:44,437 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:16:44,443 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:16:44,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0270a.c [2022-10-16 01:16:44,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b117fb29/b275fec9db0f43e4aeb08fd95a91b885/FLAG11894ca9c [2022-10-16 01:16:45,123 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:16:45,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0270a.c [2022-10-16 01:16:45,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b117fb29/b275fec9db0f43e4aeb08fd95a91b885/FLAG11894ca9c [2022-10-16 01:16:45,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b117fb29/b275fec9db0f43e4aeb08fd95a91b885 [2022-10-16 01:16:45,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:16:45,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:16:45,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:16:45,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:16:45,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:16:45,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:45,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ba5dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45, skipping insertion in model container [2022-10-16 01:16:45,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:45,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:16:45,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:16:45,792 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_0270a.c[5868,5881] [2022-10-16 01:16:45,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:16:45,806 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:16:45,869 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_0270a.c[5868,5881] [2022-10-16 01:16:45,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:16:45,907 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:16:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45 WrapperNode [2022-10-16 01:16:45,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:16:45,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:16:45,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:16:45,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:16:45,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:45,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,007 INFO L138 Inliner]: procedures = 17, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 308 [2022-10-16 01:16:46,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:16:46,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:16:46,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:16:46,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:16:46,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,088 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:16:46,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:16:46,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:16:46,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:16:46,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (1/1) ... [2022-10-16 01:16:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:16:46,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:16:46,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 01:16:46,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 01:16:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:16:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:16:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 01:16:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 01:16:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:16:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 01:16:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:16:46,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:16:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:16:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:16:46,352 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:16:46,354 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:16:47,153 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:16:47,167 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:16:47,171 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-10-16 01:16:47,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:16:47 BoogieIcfgContainer [2022-10-16 01:16:47,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:16:47,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:16:47,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:16:47,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:16:47,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:16:45" (1/3) ... [2022-10-16 01:16:47,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d2f30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:16:47, skipping insertion in model container [2022-10-16 01:16:47,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:16:45" (2/3) ... [2022-10-16 01:16:47,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d2f30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:16:47, skipping insertion in model container [2022-10-16 01:16:47,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:16:47" (3/3) ... [2022-10-16 01:16:47,188 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0270a.c [2022-10-16 01:16:47,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:16:47,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-10-16 01:16:47,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:16:47,297 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;@32bced42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:16:47,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-10-16 01:16:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 102 states have (on average 1.9019607843137254) internal successors, (194), 140 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 01:16:47,311 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:16:47,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 01:16:47,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-16 01:16:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:16:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-16 01:16:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:16:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663339948] [2022-10-16 01:16:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:16:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:16:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:16:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:16:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:16:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663339948] [2022-10-16 01:16:47,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663339948] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:16:47,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:16:47,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:16:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351388889] [2022-10-16 01:16:47,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:16:47,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:16:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:16:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:16:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:47,812 INFO L87 Difference]: Start difference. First operand has 141 states, 102 states have (on average 1.9019607843137254) internal successors, (194), 140 states have internal predecessors, (194), 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) 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-16 01:16:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:16:47,954 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2022-10-16 01:16:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:16:47,958 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-16 01:16:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:16:47,974 INFO L225 Difference]: With dead ends: 139 [2022-10-16 01:16:47,975 INFO L226 Difference]: Without dead ends: 137 [2022-10-16 01:16:47,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:47,981 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:16:47,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 277 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:16:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-16 01:16:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-10-16 01:16:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 136 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2022-10-16 01:16:48,030 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 4 [2022-10-16 01:16:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:16:48,031 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2022-10-16 01:16:48,031 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-16 01:16:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2022-10-16 01:16:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 01:16:48,032 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:16:48,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 01:16:48,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:16:48,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-16 01:16:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:16:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-16 01:16:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:16:48,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421941274] [2022-10-16 01:16:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:16:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:16:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:16:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:16:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:16:48,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421941274] [2022-10-16 01:16:48,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421941274] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:16:48,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:16:48,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:16:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099747447] [2022-10-16 01:16:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:16:48,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:16:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:16:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:16:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,170 INFO L87 Difference]: Start difference. First operand 137 states and 166 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-16 01:16:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:16:48,252 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2022-10-16 01:16:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:16:48,253 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-16 01:16:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:16:48,255 INFO L225 Difference]: With dead ends: 135 [2022-10-16 01:16:48,255 INFO L226 Difference]: Without dead ends: 135 [2022-10-16 01:16:48,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,257 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:16:48,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 281 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:16:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-10-16 01:16:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-10-16 01:16:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.6237623762376239) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-10-16 01:16:48,271 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 4 [2022-10-16 01:16:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:16:48,272 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-10-16 01:16:48,272 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-16 01:16:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-10-16 01:16:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 01:16:48,273 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:16:48,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:16:48,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:16:48,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-16 01:16:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:16:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1764742113, now seen corresponding path program 1 times [2022-10-16 01:16:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:16:48,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047014340] [2022-10-16 01:16:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:16:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:16:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:16:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:16:48,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:16:48,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047014340] [2022-10-16 01:16:48,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047014340] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:16:48,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:16:48,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:16:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169373944] [2022-10-16 01:16:48,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:16:48,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:16:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:16:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:16:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,347 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:16:48,387 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-10-16 01:16:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:16:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-16 01:16:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:16:48,390 INFO L225 Difference]: With dead ends: 249 [2022-10-16 01:16:48,390 INFO L226 Difference]: Without dead ends: 249 [2022-10-16 01:16:48,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,395 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 136 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:16:48,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 312 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:16:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-16 01:16:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2022-10-16 01:16:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 173 states have (on average 1.6184971098265897) internal successors, (280), 206 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2022-10-16 01:16:48,418 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 11 [2022-10-16 01:16:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:16:48,418 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2022-10-16 01:16:48,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2022-10-16 01:16:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 01:16:48,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:16:48,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:16:48,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:16:48,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-16 01:16:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:16:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 99498845, now seen corresponding path program 1 times [2022-10-16 01:16:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:16:48,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444651074] [2022-10-16 01:16:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:16:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:16:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:16:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:16:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:16:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444651074] [2022-10-16 01:16:48,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444651074] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:16:48,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:16:48,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:16:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928946193] [2022-10-16 01:16:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:16:48,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:16:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:16:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:16:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,561 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:16:48,646 INFO L93 Difference]: Finished difference Result 205 states and 278 transitions. [2022-10-16 01:16:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:16:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-10-16 01:16:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:16:48,654 INFO L225 Difference]: With dead ends: 205 [2022-10-16 01:16:48,654 INFO L226 Difference]: Without dead ends: 205 [2022-10-16 01:16:48,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,665 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:16:48,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 268 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:16:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-10-16 01:16:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-10-16 01:16:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.606936416184971) internal successors, (278), 204 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 278 transitions. [2022-10-16 01:16:48,697 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 278 transitions. Word has length 14 [2022-10-16 01:16:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:16:48,700 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 278 transitions. [2022-10-16 01:16:48,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2022-10-16 01:16:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 01:16:48,704 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:16:48,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:16:48,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:16:48,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-16 01:16:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:16:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 99498846, now seen corresponding path program 1 times [2022-10-16 01:16:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:16:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951017784] [2022-10-16 01:16:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:16:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:16:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:16:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:16:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:16:48,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951017784] [2022-10-16 01:16:48,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951017784] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:16:48,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:16:48,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:16:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631465481] [2022-10-16 01:16:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:16:48,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:16:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:16:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:16:48,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,890 INFO L87 Difference]: Start difference. First operand 205 states and 278 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:16:48,960 INFO L93 Difference]: Finished difference Result 203 states and 276 transitions. [2022-10-16 01:16:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:16:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-10-16 01:16:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:16:48,963 INFO L225 Difference]: With dead ends: 203 [2022-10-16 01:16:48,963 INFO L226 Difference]: Without dead ends: 203 [2022-10-16 01:16:48,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:16:48,965 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:16:48,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:16:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-10-16 01:16:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-10-16 01:16:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 202 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 276 transitions. [2022-10-16 01:16:48,977 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 276 transitions. Word has length 14 [2022-10-16 01:16:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:16:48,977 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 276 transitions. [2022-10-16 01:16:48,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:16:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 276 transitions. [2022-10-16 01:16:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:16:48,979 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:16:48,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:16:48,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:16:48,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-16 01:16:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:16:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1863636308, now seen corresponding path program 1 times [2022-10-16 01:16:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:16:48,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864948806] [2022-10-16 01:16:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:16:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:16:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:16:49,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:16:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:16:49,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:16:49,087 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:16:49,088 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2022-10-16 01:16:49,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2022-10-16 01:16:49,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2022-10-16 01:16:49,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2022-10-16 01:16:49,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2022-10-16 01:16:49,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2022-10-16 01:16:49,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2022-10-16 01:16:49,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2022-10-16 01:16:49,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2022-10-16 01:16:49,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2022-10-16 01:16:49,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2022-10-16 01:16:49,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2022-10-16 01:16:49,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2022-10-16 01:16:49,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2022-10-16 01:16:49,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2022-10-16 01:16:49,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2022-10-16 01:16:49,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2022-10-16 01:16:49,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2022-10-16 01:16:49,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2022-10-16 01:16:49,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2022-10-16 01:16:49,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2022-10-16 01:16:49,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2022-10-16 01:16:49,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2022-10-16 01:16:49,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2022-10-16 01:16:49,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2022-10-16 01:16:49,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2022-10-16 01:16:49,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2022-10-16 01:16:49,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2022-10-16 01:16:49,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2022-10-16 01:16:49,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2022-10-16 01:16:49,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2022-10-16 01:16:49,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2022-10-16 01:16:49,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2022-10-16 01:16:49,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2022-10-16 01:16:49,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2022-10-16 01:16:49,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2022-10-16 01:16:49,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 38 remaining) [2022-10-16 01:16:49,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-10-16 01:16:49,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:16:49,106 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-10-16 01:16:49,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:16:49,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:16:49 BoogieIcfgContainer [2022-10-16 01:16:49,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:16:49,151 INFO L158 Benchmark]: Toolchain (without parser) took 3660.97ms. Allocated memory was 156.2MB in the beginning and 187.7MB in the end (delta: 31.5MB). Free memory was 128.7MB in the beginning and 144.8MB in the end (delta: -16.1MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2022-10-16 01:16:49,152 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 156.2MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:16:49,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.97ms. Allocated memory is still 156.2MB. Free memory was 128.3MB in the beginning and 114.1MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 01:16:49,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.86ms. Allocated memory is still 156.2MB. Free memory was 114.1MB in the beginning and 109.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-16 01:16:49,153 INFO L158 Benchmark]: Boogie Preprocessor took 100.89ms. Allocated memory is still 156.2MB. Free memory was 109.4MB in the beginning and 105.8MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 01:16:49,154 INFO L158 Benchmark]: RCFGBuilder took 1065.02ms. Allocated memory is still 156.2MB. Free memory was 105.8MB in the beginning and 63.3MB in the end (delta: 42.6MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-10-16 01:16:49,154 INFO L158 Benchmark]: TraceAbstraction took 1971.44ms. Allocated memory was 156.2MB in the beginning and 187.7MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 144.8MB in the end (delta: -81.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:16:49,157 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.64ms. Allocated memory is still 156.2MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 408.97ms. Allocated memory is still 156.2MB. Free memory was 128.3MB in the beginning and 114.1MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.86ms. Allocated memory is still 156.2MB. Free memory was 114.1MB in the beginning and 109.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 100.89ms. Allocated memory is still 156.2MB. Free memory was 109.4MB in the beginning and 105.8MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1065.02ms. Allocated memory is still 156.2MB. Free memory was 105.8MB in the beginning and 63.3MB in the end (delta: 42.6MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1971.44ms. Allocated memory was 156.2MB in the beginning and 187.7MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 144.8MB in the end (delta: -81.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 241, overapproximation of someUnaryDOUBLEoperation at line 150, overapproximation of memtrack at line 242. Possible FailurePath: [L18] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L144-L158] static const double one_asin = 1.00000000000000000000e+00, huge_asin = 1.000e+300, pio2_hi_asin = 1.57079632679489655800e+00, pio2_lo_asin = 6.12323399573676603587e-17, pio4_hi_asin = 7.85398163397448278999e-01, pS0_asin = 1.66666666666666657415e-01, pS1_asin = -3.25565818622400915405e-01, pS2_asin = 2.01212532134862925881e-01, pS3_asin = -4.00555345006794114027e-02, pS4_asin = 7.91534994289814532176e-04, pS5_asin = 3.47933107596021167570e-05, qS1_asin = -2.40339491173441421878e+00, qS2_asin = 2.02094576023350569471e+00, qS3_asin = -6.88283971605453293030e-01, qS4_asin = 7.70381505559019352791e-02; VAL [huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L237] double x = 0.0; [L238] CALL, EXPR __ieee754_asin(x) [L161] double t, w, p, q, c, r, s; [L162] __int32_t hx, ix; VAL [\old(x)=0, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L164] ieee_double_shape_type gh_u; VAL [\old(x)=0, gh_u={5:0}, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L165] gh_u.value = (x) VAL [\old(x)=0, gh_u={5:0}, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L166] EXPR gh_u.parts.msw VAL [\old(x)=0, gh_u={5:0}, gh_u.parts.msw=4294967296, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L166] (hx) = gh_u.parts.msw [L168] ix = hx & 0x7fffffff VAL [\old(x)=0, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L169] COND FALSE !(ix >= 0x3ff00000) VAL [\old(x)=0, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L180] COND TRUE ix < 0x3fe00000 VAL [\old(x)=0, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L181] COND TRUE ix < 0x3e400000 VAL [\old(x)=0, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L182] COND TRUE huge_asin + x > one_asin [L183] return x; VAL [\old(x)=0, \result=0, huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L238] RET, EXPR __ieee754_asin(x) [L238] double res = __ieee754_asin(x); [L241] COND TRUE res != x VAL [huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, res=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L242] reach_error() VAL [huge_asin=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=785398163397448279/500000000000000000, pio2_lo_asin=612323399573676603587/10000000000000000000000000000000000000, pio4_hi_asin=785398163397448278999/1000000000000000000000, pS0_asin=33333333333333331483/200000000000000000000, pS2_asin=201212532134862925881/1000000000000000000000, pS4_asin=49470937143113408261/62500000000000000000000, pS5_asin=34793310759602116757/1000000000000000000000000, qS2_asin=202094576023350569471/100000000000000000000, qS4_asin=770381505559019352791/10000000000000000000000, res=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=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: 229]: 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 1 procedures, 141 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 1413 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 613 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 800 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=3, InterpolantAutomatonStates: 15, 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, 5 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 01:16:49,183 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...