/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_0270b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:41,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:41,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:42,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:42,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:42,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:42,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:42,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:42,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:42,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:42,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:42,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:42,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:42,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:42,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:42,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:42,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:42,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:42,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:42,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:42,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:42,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:42,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:42,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:42,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:42,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:42,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:42,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:42,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:42,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:42,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:42,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:42,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:42,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:42,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:42,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:42,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:42,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:42,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:42,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:42,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:42,155 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:42,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:42,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:42,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:42,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:42,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:42,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:42,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:42,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:42,220 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:42,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:42,221 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:42,221 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:42,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:42,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:42,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:42,222 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:42,222 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:42,223 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:42,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:42,223 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:42,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:42,223 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:42,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:42,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:42,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:42,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:42,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:42,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:42,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:42,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:42,226 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:42,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:42,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:42,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:42,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:42,726 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:42,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0270b.c [2022-10-15 16:44:42,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed293c55/fed4c999d9444aa69ac96b164e160f76/FLAG705ec6e3a [2022-10-15 16:44:43,709 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:43,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0270b.c [2022-10-15 16:44:43,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed293c55/fed4c999d9444aa69ac96b164e160f76/FLAG705ec6e3a [2022-10-15 16:44:44,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ed293c55/fed4c999d9444aa69ac96b164e160f76 [2022-10-15 16:44:44,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:44,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:44,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:44,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:44,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:44,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:44" (1/1) ... [2022-10-15 16:44:44,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741e6115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:44, skipping insertion in model container [2022-10-15 16:44:44,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:44" (1/1) ... [2022-10-15 16:44:44,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:44,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:44,448 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_0270b.c[4700,4713] [2022-10-15 16:44:44,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:44,483 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:44,611 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_0270b.c[4700,4713] [2022-10-15 16:44:44,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:44,644 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:44,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:44 WrapperNode [2022-10-15 16:44:44,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:44,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:44,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:44,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:44,662 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:44" (1/1) ... [2022-10-15 16:44:44,697 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:44" (1/1) ... [2022-10-15 16:44:44,777 INFO L138 Inliner]: procedures = 19, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 292 [2022-10-15 16:44:44,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:44,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:44,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:44,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:44,797 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:44" (1/1) ... [2022-10-15 16:44:44,798 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:44" (1/1) ... [2022-10-15 16:44:44,823 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:44" (1/1) ... [2022-10-15 16:44:44,823 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:44" (1/1) ... [2022-10-15 16:44:44,860 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:44" (1/1) ... [2022-10-15 16:44:44,886 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:44" (1/1) ... [2022-10-15 16:44:44,890 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:44" (1/1) ... [2022-10-15 16:44:44,897 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:44" (1/1) ... [2022-10-15 16:44:44,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:44,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:44,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:44,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:44,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:44" (1/1) ... [2022-10-15 16:44:44,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:44,967 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:44,986 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:45,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:45,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:45,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:45,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:45,247 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:45,250 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:46,035 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:46,059 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:46,060 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-10-15 16:44:46,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:46 BoogieIcfgContainer [2022-10-15 16:44:46,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:46,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:46,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:46,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:46,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:44" (1/3) ... [2022-10-15 16:44:46,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491bf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:46, skipping insertion in model container [2022-10-15 16:44:46,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:44" (2/3) ... [2022-10-15 16:44:46,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491bf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:46, skipping insertion in model container [2022-10-15 16:44:46,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:46" (3/3) ... [2022-10-15 16:44:46,087 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0270b.c [2022-10-15 16:44:46,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:46,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-10-15 16:44:46,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:46,245 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;@d1d3ff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:46,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-10-15 16:44:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 126 states have internal predecessors, (176), 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:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:46,261 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:46,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:46,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:44:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:46,272 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:44:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:46,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369283545] [2022-10-15 16:44:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:46,581 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:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:46,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369283545] [2022-10-15 16:44:46,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369283545] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:46,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:46,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:46,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369032012] [2022-10-15 16:44:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:46,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:46,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:46,639 INFO L87 Difference]: Start difference. First operand has 127 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 126 states have internal predecessors, (176), 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:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:46,775 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-10-15 16:44:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:46,778 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:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:46,791 INFO L225 Difference]: With dead ends: 125 [2022-10-15 16:44:46,791 INFO L226 Difference]: Without dead ends: 123 [2022-10-15 16:44:46,794 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:46,799 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:46,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 239 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-15 16:44:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-10-15 16:44:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 91 states have (on average 1.6043956043956045) internal successors, (146), 122 states have internal predecessors, (146), 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:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2022-10-15 16:44:46,858 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 4 [2022-10-15 16:44:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:46,859 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2022-10-15 16:44:46,859 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:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2022-10-15 16:44:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:46,860 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:46,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:46,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:46,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:44:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:44:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:46,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525148717] [2022-10-15 16:44:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:47,090 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:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:47,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525148717] [2022-10-15 16:44:47,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525148717] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:47,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:47,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908317943] [2022-10-15 16:44:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:47,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:47,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:47,098 INFO L87 Difference]: Start difference. First operand 123 states and 146 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:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:47,193 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2022-10-15 16:44:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:47,193 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:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:47,196 INFO L225 Difference]: With dead ends: 121 [2022-10-15 16:44:47,196 INFO L226 Difference]: Without dead ends: 121 [2022-10-15 16:44:47,197 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:47,200 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:47,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-10-15 16:44:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-10-15 16:44:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 120 states have internal predecessors, (144), 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:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2022-10-15 16:44:47,231 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 4 [2022-10-15 16:44:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:47,232 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2022-10-15 16:44:47,232 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:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2022-10-15 16:44:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:44:47,235 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:47,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:47,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:47,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:44:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash -586388357, now seen corresponding path program 1 times [2022-10-15 16:44:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:47,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965683950] [2022-10-15 16:44:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:47,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:47,311 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:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:47,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965683950] [2022-10-15 16:44:47,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965683950] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:47,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:47,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:44:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285147248] [2022-10-15 16:44:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:47,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:47,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:47,316 INFO L87 Difference]: Start difference. First operand 121 states and 144 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:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:47,358 INFO L93 Difference]: Finished difference Result 231 states and 270 transitions. [2022-10-15 16:44:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:47,359 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:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:47,362 INFO L225 Difference]: With dead ends: 231 [2022-10-15 16:44:47,362 INFO L226 Difference]: Without dead ends: 231 [2022-10-15 16:44:47,363 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:47,365 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 126 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 289 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:47,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 289 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:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-10-15 16:44:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 177. [2022-10-15 16:44:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 176 states have internal predecessors, (231), 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:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2022-10-15 16:44:47,386 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 13 [2022-10-15 16:44:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:47,386 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2022-10-15 16:44:47,387 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:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2022-10-15 16:44:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:47,388 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:47,388 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:47,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:47,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:44:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 54912351, now seen corresponding path program 1 times [2022-10-15 16:44:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:47,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604215315] [2022-10-15 16:44:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:47,501 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:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:47,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604215315] [2022-10-15 16:44:47,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604215315] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:47,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:47,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125509406] [2022-10-15 16:44:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:47,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:47,506 INFO L87 Difference]: Start difference. First operand 177 states and 231 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:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:47,585 INFO L93 Difference]: Finished difference Result 175 states and 227 transitions. [2022-10-15 16:44:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:47,585 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:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:47,588 INFO L225 Difference]: With dead ends: 175 [2022-10-15 16:44:47,588 INFO L226 Difference]: Without dead ends: 175 [2022-10-15 16:44:47,588 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:47,591 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:47,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-10-15 16:44:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-10-15 16:44:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.5442176870748299) internal successors, (227), 174 states have internal predecessors, (227), 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:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 227 transitions. [2022-10-15 16:44:47,636 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 227 transitions. Word has length 16 [2022-10-15 16:44:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:47,636 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 227 transitions. [2022-10-15 16:44:47,637 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:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 227 transitions. [2022-10-15 16:44:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:47,641 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:47,641 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:47,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:47,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:44:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash 54912352, now seen corresponding path program 1 times [2022-10-15 16:44:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:47,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551881192] [2022-10-15 16:44:47,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:47,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:47,825 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:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:47,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551881192] [2022-10-15 16:44:47,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551881192] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:47,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918679570] [2022-10-15 16:44:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:47,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:47,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:47,830 INFO L87 Difference]: Start difference. First operand 175 states and 227 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:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:47,897 INFO L93 Difference]: Finished difference Result 173 states and 223 transitions. [2022-10-15 16:44:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:47,898 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:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:47,900 INFO L225 Difference]: With dead ends: 173 [2022-10-15 16:44:47,900 INFO L226 Difference]: Without dead ends: 173 [2022-10-15 16:44:47,900 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:47,902 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:47,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 238 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-10-15 16:44:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-10-15 16:44:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 147 states have (on average 1.5170068027210883) internal successors, (223), 172 states have internal predecessors, (223), 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:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 223 transitions. [2022-10-15 16:44:47,913 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 223 transitions. Word has length 16 [2022-10-15 16:44:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:47,914 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 223 transitions. [2022-10-15 16:44:47,914 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:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 223 transitions. [2022-10-15 16:44:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:47,915 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:47,915 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:47,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:47,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:44:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1137632503, now seen corresponding path program 1 times [2022-10-15 16:44:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:47,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726697926] [2022-10-15 16:44:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:47,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:48,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:48,016 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:48,017 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (33 of 34 remaining) [2022-10-15 16:44:48,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 34 remaining) [2022-10-15 16:44:48,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 34 remaining) [2022-10-15 16:44:48,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 34 remaining) [2022-10-15 16:44:48,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 34 remaining) [2022-10-15 16:44:48,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 34 remaining) [2022-10-15 16:44:48,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 34 remaining) [2022-10-15 16:44:48,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 34 remaining) [2022-10-15 16:44:48,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 34 remaining) [2022-10-15 16:44:48,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 34 remaining) [2022-10-15 16:44:48,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 34 remaining) [2022-10-15 16:44:48,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 34 remaining) [2022-10-15 16:44:48,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 34 remaining) [2022-10-15 16:44:48,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 34 remaining) [2022-10-15 16:44:48,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 34 remaining) [2022-10-15 16:44:48,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 34 remaining) [2022-10-15 16:44:48,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 34 remaining) [2022-10-15 16:44:48,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 34 remaining) [2022-10-15 16:44:48,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 34 remaining) [2022-10-15 16:44:48,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 34 remaining) [2022-10-15 16:44:48,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 34 remaining) [2022-10-15 16:44:48,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 34 remaining) [2022-10-15 16:44:48,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 34 remaining) [2022-10-15 16:44:48,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 34 remaining) [2022-10-15 16:44:48,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 34 remaining) [2022-10-15 16:44:48,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 34 remaining) [2022-10-15 16:44:48,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 34 remaining) [2022-10-15 16:44:48,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 34 remaining) [2022-10-15 16:44:48,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 34 remaining) [2022-10-15 16:44:48,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 34 remaining) [2022-10-15 16:44:48,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 34 remaining) [2022-10-15 16:44:48,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 34 remaining) [2022-10-15 16:44:48,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 34 remaining) [2022-10-15 16:44:48,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (0 of 34 remaining) [2022-10-15 16:44:48,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:44:48,035 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-10-15 16:44:48,040 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:48,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:48 BoogieIcfgContainer [2022-10-15 16:44:48,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:48,089 INFO L158 Benchmark]: Toolchain (without parser) took 4077.43ms. Allocated memory is still 151.0MB. Free memory was 125.9MB in the beginning and 97.4MB in the end (delta: 28.5MB). Peak memory consumption was 29.2MB. Max. memory is 8.0GB. [2022-10-15 16:44:48,089 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:48,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.53ms. Allocated memory is still 151.0MB. Free memory was 125.7MB in the beginning and 112.7MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:44:48,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.59ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 110.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:48,091 INFO L158 Benchmark]: Boogie Preprocessor took 128.62ms. Allocated memory is still 151.0MB. Free memory was 110.0MB in the beginning and 107.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:48,092 INFO L158 Benchmark]: RCFGBuilder took 1161.06ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 115.1MB in the end (delta: -7.5MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-10-15 16:44:48,092 INFO L158 Benchmark]: TraceAbstraction took 2011.77ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 97.4MB in the end (delta: 16.7MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-10-15 16:44:48,095 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 626.53ms. Allocated memory is still 151.0MB. Free memory was 125.7MB in the beginning and 112.7MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 129.59ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 110.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 128.62ms. Allocated memory is still 151.0MB. Free memory was 110.0MB in the beginning and 107.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1161.06ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 115.1MB in the end (delta: -7.5MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2011.77ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 97.4MB in the end (delta: 16.7MB). Peak memory consumption was 17.2MB. 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: 200]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 199, overapproximation of someUnaryDOUBLEoperation at line 113, overapproximation of memtrack at line 200, overapproximation of someUnaryFLOAToperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 130. Possible FailurePath: [L26] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L109-L117] 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, 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] [L195] float x = 0.0f; [L196] CALL, EXPR __ieee754_asinf(x) [L120] float t, w, p, q, c, r, s; [L121] __int32_t hx, ix; VAL [\old(x)=0, huge_asin=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=0] [L123] ieee_float_shape_type gf_u; VAL [\old(x)=0, gf_u={5:0}, huge_asin=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=0] [L124] gf_u.value = (x) VAL [\old(x)=0, gf_u={5:0}, huge_asin=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=0] [L125] EXPR gf_u.word VAL [\old(x)=0, gf_u={5:0}, gf_u.word=6442450943, huge_asin=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=0] [L125] (hx) = gf_u.word [L127] ix = hx & 0x7fffffff VAL [\old(x)=0, huge_asin=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=0] [L128] COND TRUE ix == 0x3f800000 [L130] return x * pio2_hi_asin + x * pio2_lo_asin; VAL [\old(x)=0, huge_asin=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=0] [L196] RET, EXPR __ieee754_asinf(x) [L196] float res = __ieee754_asinf(x); [L199] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_asin=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=1000000000000000000000000000008, res == 0.0f && __signbit_float(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000, x=0] [L199] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L200] reach_error() VAL [huge_asin=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=1000000000000000000000000000008, tiny_sqrt=1/1000000000000000000000000000000, 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: 187]: 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, 127 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 1239 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 717 mSDtfsCounter, 200 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=177occurred 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, 54 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s 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:48,159 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...