/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/float_req_bl_0250a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:39,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:39,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:39,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:39,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:39,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:39,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:39,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:39,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:39,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:39,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:39,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:39,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:39,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:39,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:39,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:39,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:39,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:39,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:39,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:39,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:39,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:39,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:39,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:39,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:39,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:39,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:39,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:39,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:39,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:39,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:39,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:39,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:39,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:39,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:39,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:39,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:39,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:39,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:39,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:39,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:39,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:44:40,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:40,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:40,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:40,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:40,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:40,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:40,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:40,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:40,054 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:40,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:40,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:40,056 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:40,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:40,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:40,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:40,057 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:40,057 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:40,058 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:40,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:40,058 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:40,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:40,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:40,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:40,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:40,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:40,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:40,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:40,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:40,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:40,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:40,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:44:40,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:40,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:40,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:40,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:40,538 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:40,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0250a.c [2022-10-15 16:44:40,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9f30ac1/fc9d98c9424a46258426870275f50e6d/FLAG484212e0b [2022-10-15 16:44:41,365 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:41,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0250a.c [2022-10-15 16:44:41,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9f30ac1/fc9d98c9424a46258426870275f50e6d/FLAG484212e0b [2022-10-15 16:44:41,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9f30ac1/fc9d98c9424a46258426870275f50e6d [2022-10-15 16:44:41,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:41,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:41,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:41,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:41,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:41,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:41" (1/1) ... [2022-10-15 16:44:41,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb1b68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:41, skipping insertion in model container [2022-10-15 16:44:41,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:41" (1/1) ... [2022-10-15 16:44:41,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:41,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:42,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0250a.c[5433,5446] [2022-10-15 16:44:42,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:42,037 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:42,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0250a.c[5433,5446] [2022-10-15 16:44:42,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:42,168 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:42,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42 WrapperNode [2022-10-15 16:44:42,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:42,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:42,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:42,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:42,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,301 INFO L138 Inliner]: procedures = 20, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 276 [2022-10-15 16:44:42,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:42,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:42,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:42,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:42,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,395 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:42,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:42,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:42,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:42,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (1/1) ... [2022-10-15 16:44:42,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:42,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:42,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:44:42,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:44:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:42,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:42,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:42,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:42,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:42,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:42,713 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:42,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:43,342 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:43,355 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:43,355 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 16:44:43,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:43 BoogieIcfgContainer [2022-10-15 16:44:43,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:43,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:43,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:43,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:43,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:41" (1/3) ... [2022-10-15 16:44:43,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6982380d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:43, skipping insertion in model container [2022-10-15 16:44:43,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:42" (2/3) ... [2022-10-15 16:44:43,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6982380d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:43, skipping insertion in model container [2022-10-15 16:44:43,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:43" (3/3) ... [2022-10-15 16:44:43,369 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0250a.c [2022-10-15 16:44:43,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:43,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-10-15 16:44:43,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:43,463 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;@24693e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:43,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-10-15 16:44:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.9058823529411764) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:43,477 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:43,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:43,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:44:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:44:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466092853] [2022-10-15 16:44:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:43,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466092853] [2022-10-15 16:44:43,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466092853] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:43,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:43,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:43,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12090853] [2022-10-15 16:44:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:43,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:43,846 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.9058823529411764) internal successors, (162), 115 states have internal predecessors, (162), 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-15 16:44:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:44,000 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2022-10-15 16:44:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:44:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:44,017 INFO L225 Difference]: With dead ends: 114 [2022-10-15 16:44:44,017 INFO L226 Difference]: Without dead ends: 112 [2022-10-15 16:44:44,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,025 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:44,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-10-15 16:44:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-10-15 16:44:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 111 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2022-10-15 16:44:44,080 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 4 [2022-10-15 16:44:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:44,080 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2022-10-15 16:44:44,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-10-15 16:44:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:44,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:44,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:44,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:44,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:44:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:44:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:44,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414767483] [2022-10-15 16:44:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:44,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:44,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:44,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414767483] [2022-10-15 16:44:44,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414767483] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:44,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:44,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127382076] [2022-10-15 16:44:44,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,252 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:44,343 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2022-10-15 16:44:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:44:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:44,346 INFO L225 Difference]: With dead ends: 110 [2022-10-15 16:44:44,346 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:44:44,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,349 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:44,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 225 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:44:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-10-15 16:44:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 109 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2022-10-15 16:44:44,364 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 4 [2022-10-15 16:44:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:44,365 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2022-10-15 16:44:44,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2022-10-15 16:44:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:44:44,367 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:44,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:44,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:44,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:44:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash -586413214, now seen corresponding path program 1 times [2022-10-15 16:44:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:44,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373492119] [2022-10-15 16:44:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:44,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373492119] [2022-10-15 16:44:44,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373492119] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:44,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:44,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:44:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078263894] [2022-10-15 16:44:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,510 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:44,566 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2022-10-15 16:44:44,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:44,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-15 16:44:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:44,570 INFO L225 Difference]: With dead ends: 209 [2022-10-15 16:44:44,570 INFO L226 Difference]: Without dead ends: 209 [2022-10-15 16:44:44,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,573 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 114 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:44,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-15 16:44:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2022-10-15 16:44:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.5642857142857143) internal successors, (219), 165 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 219 transitions. [2022-10-15 16:44:44,595 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 219 transitions. Word has length 13 [2022-10-15 16:44:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:44,596 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 219 transitions. [2022-10-15 16:44:44,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 219 transitions. [2022-10-15 16:44:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:44,597 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:44,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:44,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:44,598 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:44:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 54912351, now seen corresponding path program 1 times [2022-10-15 16:44:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:44,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172106435] [2022-10-15 16:44:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:44,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172106435] [2022-10-15 16:44:44,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172106435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:44,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:44,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103496381] [2022-10-15 16:44:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:44,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,718 INFO L87 Difference]: Start difference. First operand 166 states and 219 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:44,829 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2022-10-15 16:44:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:44,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-10-15 16:44:44,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:44,832 INFO L225 Difference]: With dead ends: 164 [2022-10-15 16:44:44,832 INFO L226 Difference]: Without dead ends: 164 [2022-10-15 16:44:44,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:44,835 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 211 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-15 16:44:44,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 211 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-10-15 16:44:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-10-15 16:44:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 140 states have (on average 1.5357142857142858) internal successors, (215), 163 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2022-10-15 16:44:44,864 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 16 [2022-10-15 16:44:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:44,864 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2022-10-15 16:44:44,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2022-10-15 16:44:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:44,866 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:44,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:44,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:44,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:44:44,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 54912352, now seen corresponding path program 1 times [2022-10-15 16:44:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:44,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368230429] [2022-10-15 16:44:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:45,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368230429] [2022-10-15 16:44:45,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368230429] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:45,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:45,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548611354] [2022-10-15 16:44:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:45,044 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:45,112 INFO L93 Difference]: Finished difference Result 162 states and 211 transitions. [2022-10-15 16:44:45,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:45,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-10-15 16:44:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:45,114 INFO L225 Difference]: With dead ends: 162 [2022-10-15 16:44:45,114 INFO L226 Difference]: Without dead ends: 162 [2022-10-15 16:44:45,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:45,117 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:45,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-10-15 16:44:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-10-15 16:44:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 161 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2022-10-15 16:44:45,139 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 16 [2022-10-15 16:44:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:45,140 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2022-10-15 16:44:45,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2022-10-15 16:44:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:45,141 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:45,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:45,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:45,145 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:44:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1137607646, now seen corresponding path program 1 times [2022-10-15 16:44:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:45,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509287073] [2022-10-15 16:44:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:45,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:45,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:45,298 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:45,300 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (29 of 30 remaining) [2022-10-15 16:44:45,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2022-10-15 16:44:45,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2022-10-15 16:44:45,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2022-10-15 16:44:45,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2022-10-15 16:44:45,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2022-10-15 16:44:45,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2022-10-15 16:44:45,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2022-10-15 16:44:45,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2022-10-15 16:44:45,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2022-10-15 16:44:45,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2022-10-15 16:44:45,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2022-10-15 16:44:45,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2022-10-15 16:44:45,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2022-10-15 16:44:45,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2022-10-15 16:44:45,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2022-10-15 16:44:45,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2022-10-15 16:44:45,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2022-10-15 16:44:45,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2022-10-15 16:44:45,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2022-10-15 16:44:45,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2022-10-15 16:44:45,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2022-10-15 16:44:45,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2022-10-15 16:44:45,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2022-10-15 16:44:45,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2022-10-15 16:44:45,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2022-10-15 16:44:45,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2022-10-15 16:44:45,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2022-10-15 16:44:45,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2022-10-15 16:44:45,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2022-10-15 16:44:45,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:44:45,316 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-10-15 16:44:45,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:45,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:45 BoogieIcfgContainer [2022-10-15 16:44:45,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:45,367 INFO L158 Benchmark]: Toolchain (without parser) took 3649.17ms. Allocated memory is still 151.0MB. Free memory was 125.6MB in the beginning and 100.9MB in the end (delta: 24.8MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2022-10-15 16:44:45,368 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:45,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.28ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 111.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:44:45,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.42ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 109.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:45,369 INFO L158 Benchmark]: Boogie Preprocessor took 113.00ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 106.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:45,370 INFO L158 Benchmark]: RCFGBuilder took 940.83ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 116.9MB in the end (delta: -10.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-10-15 16:44:45,371 INFO L158 Benchmark]: TraceAbstraction took 2005.61ms. Allocated memory is still 151.0MB. Free memory was 116.4MB in the beginning and 100.9MB in the end (delta: 15.6MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-10-15 16:44:45,373 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.25ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.28ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 111.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 131.42ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 109.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 113.00ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 106.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 940.83ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 116.9MB in the end (delta: -10.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2005.61ms. Allocated memory is still 151.0MB. Free memory was 116.4MB in the beginning and 100.9MB in the end (delta: 15.6MB). Peak memory consumption was 15.6MB. 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: 235]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someUnaryDOUBLEoperation at line 149, overapproximation of memtrack at line 235, overapproximation of someUnaryFLOAToperation at line 147, overapproximation of someBinaryArithmeticFLOAToperation at line 166. Possible FailurePath: [L14] static const float huge_floor = 1.0e30; [L62] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L145-L153] static const float one_asin = 1.0000000000e+00, huge_asin = 1.000e+30, pio2_hi_asin = 1.57079637050628662109375f, pio2_lo_asin = -4.37113900018624283e-8f, pio4_hi_asin = 0.785398185253143310546875f, pS0_asin = 1.6666667163e-01, pS1_asin = -3.2556581497e-01, pS2_asin = 2.0121252537e-01, pS3_asin = -4.0055535734e-02, pS4_asin = 7.9153501429e-04, pS5_asin = 3.4793309169e-05, qS1_asin = -2.4033949375e+00, qS2_asin = 2.0209457874e+00, qS3_asin = -6.8828397989e-01, qS4_asin = 7.7038154006e-02; VAL [huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000] [L230] float x = 1.0f / 0.0f; [L231] CALL, EXPR __ieee754_asinf(x) [L156] float t, w, p, q, c, r, s; [L157] __int32_t hx, ix; VAL [\old(x)=1000000000000000000000000000008, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] [L159] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000008, gf_u={5:0}, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] [L160] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000008, gf_u={5:0}, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] [L161] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000008, gf_u={5:0}, gf_u.word=6442450943, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] [L161] (hx) = gf_u.word [L163] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000008, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=2147483647, ix=1065353216, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] [L164] COND TRUE ix == 0x3f800000 [L166] return x * pio2_hi_asin + x * pio2_lo_asin; VAL [\old(x)=1000000000000000000000000000008, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=2147483647, ix=1065353216, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] [L231] RET, EXPR __ieee754_asinf(x) [L231] float res = __ieee754_asinf(x); [L234] CALL, EXPR isnan_float(res) [L60] return x != x; VAL [\old(x)=1000000000000000000000000000009, \result=0, huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000009] [L234] RET, EXPR isnan_float(res) [L234] COND TRUE !isnan_float(res) [L235] reach_error() VAL [huge_asin=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, res=1000000000000000000000000000009, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000008] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 223]: 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, 116 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 484 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 645 mSDtfsCounter, 178 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=166occurred 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, 43 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 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-15 16:44:45,433 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...