/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/array-fpi/sina4f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:20:44,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:20:44,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:20:44,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:20:44,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:20:44,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:20:44,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:20:44,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:20:44,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:20:44,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:20:44,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:20:44,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:20:44,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:20:44,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:20:44,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:20:44,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:20:44,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:20:44,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:20:44,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:20:44,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:20:44,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:20:44,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:20:44,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:20:44,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:20:44,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:20:44,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:20:44,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:20:44,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:20:44,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:20:44,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:20:44,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:20:44,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:20:44,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:20:44,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:20:44,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:20:44,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:20:44,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:20:44,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:20:44,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:20:44,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:20:44,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:20:44,290 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:20:44,348 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:20:44,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:20:44,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:20:44,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:20:44,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:20:44,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:20:44,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:20:44,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:20:44,356 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:20:44,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:20:44,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:20:44,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:20:44,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:20:44,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:20:44,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:20:44,359 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:20:44,359 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:20:44,359 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:20:44,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:20:44,360 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:20:44,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:20:44,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:20:44,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:20:44,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:20:44,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:20:44,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:20:44,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:20:44,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:20:44,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:20:44,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:20:44,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:20:44,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:20:44,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:20:44,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:20:44,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:20:44,842 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:20:44,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4f.c [2022-10-15 16:20:44,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88e0d47c/efccad444a104b6cb29d9253d6d5fdcd/FLAGe1492354c [2022-10-15 16:20:45,542 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:20:45,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4f.c [2022-10-15 16:20:45,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88e0d47c/efccad444a104b6cb29d9253d6d5fdcd/FLAGe1492354c [2022-10-15 16:20:45,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88e0d47c/efccad444a104b6cb29d9253d6d5fdcd [2022-10-15 16:20:45,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:20:45,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:20:45,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:20:45,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:20:45,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:20:45,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:20:45" (1/1) ... [2022-10-15 16:20:45,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9940491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:45, skipping insertion in model container [2022-10-15 16:20:45,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:20:45" (1/1) ... [2022-10-15 16:20:45,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:20:45,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:20:46,086 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/array-fpi/sina4f.c[589,602] [2022-10-15 16:20:46,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:20:46,127 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:20:46,144 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/array-fpi/sina4f.c[589,602] [2022-10-15 16:20:46,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:20:46,174 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:20:46,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46 WrapperNode [2022-10-15 16:20:46,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:20:46,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:20:46,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:20:46,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:20:46,188 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:20:46" (1/1) ... [2022-10-15 16:20:46,198 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:20:46" (1/1) ... [2022-10-15 16:20:46,226 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-10-15 16:20:46,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:20:46,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:20:46,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:20:46,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:20:46,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:20:46,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:20:46,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:20:46,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:20:46,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:20:46,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:46,325 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:20:46,354 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:20:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:20:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:20:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:20:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:20:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:20:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:20:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:20:46,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:20:46,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:20:46,580 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:20:46,584 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:20:47,091 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:20:47,130 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:20:47,133 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-15 16:20:47,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:20:47 BoogieIcfgContainer [2022-10-15 16:20:47,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:20:47,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:20:47,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:20:47,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:20:47,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:20:45" (1/3) ... [2022-10-15 16:20:47,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fed3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:20:47, skipping insertion in model container [2022-10-15 16:20:47,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (2/3) ... [2022-10-15 16:20:47,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fed3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:20:47, skipping insertion in model container [2022-10-15 16:20:47,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:20:47" (3/3) ... [2022-10-15 16:20:47,151 INFO L112 eAbstractionObserver]: Analyzing ICFG sina4f.c [2022-10-15 16:20:47,188 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:20:47,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-10-15 16:20:47,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:20:47,300 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;@35be645e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:20:47,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-10-15 16:20:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 65 states have internal predecessors, (78), 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:20:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:20:47,331 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:47,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:20:47,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 925732, now seen corresponding path program 1 times [2022-10-15 16:20:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:47,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630515138] [2022-10-15 16:20:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:47,589 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:20:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:47,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630515138] [2022-10-15 16:20:47,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630515138] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:47,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:47,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869206984] [2022-10-15 16:20:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:47,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:47,644 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 65 states have internal predecessors, (78), 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:20:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:47,726 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-10-15 16:20:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:47,729 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:20:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:47,739 INFO L225 Difference]: With dead ends: 67 [2022-10-15 16:20:47,740 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 16:20:47,742 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:20:47,747 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:47,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 16:20:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 16:20:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.7) internal successors, (68), 63 states have internal predecessors, (68), 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:20:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-10-15 16:20:47,794 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 4 [2022-10-15 16:20:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:47,794 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-10-15 16:20:47,795 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:20:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-10-15 16:20:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:20:47,796 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:47,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:20:47,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:20:47,797 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:47,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash 889571242, now seen corresponding path program 1 times [2022-10-15 16:20:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:47,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24107875] [2022-10-15 16:20:47,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,288 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:20:48,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24107875] [2022-10-15 16:20:48,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24107875] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84367387] [2022-10-15 16:20:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:48,299 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:48,406 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-10-15 16:20:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:48,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:20:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:48,409 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:20:48,409 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 16:20:48,409 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:20:48,412 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 57 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:48,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 16:20:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-10-15 16:20:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 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:20:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-10-15 16:20:48,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 6 [2022-10-15 16:20:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:48,430 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-10-15 16:20:48,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-10-15 16:20:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:20:48,434 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:48,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:20:48,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:20:48,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash 889571243, now seen corresponding path program 1 times [2022-10-15 16:20:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:48,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848459956] [2022-10-15 16:20:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,646 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:20:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848459956] [2022-10-15 16:20:48,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848459956] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011860569] [2022-10-15 16:20:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:48,650 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:48,714 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-10-15 16:20:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:20:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:48,716 INFO L225 Difference]: With dead ends: 56 [2022-10-15 16:20:48,716 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 16:20:48,717 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:20:48,719 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:48,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 44 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 16:20:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-10-15 16:20:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 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:20:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-10-15 16:20:48,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 6 [2022-10-15 16:20:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:48,729 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-10-15 16:20:48,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:20:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-10-15 16:20:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:20:48,731 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:48,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:48,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:20:48,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1268642443, now seen corresponding path program 1 times [2022-10-15 16:20:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:48,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017029605] [2022-10-15 16:20:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,882 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:20:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017029605] [2022-10-15 16:20:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017029605] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664478295] [2022-10-15 16:20:48,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:48,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:48,886 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:20:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:48,938 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-10-15 16:20:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-10-15 16:20:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:48,940 INFO L225 Difference]: With dead ends: 51 [2022-10-15 16:20:48,941 INFO L226 Difference]: Without dead ends: 51 [2022-10-15 16:20:48,941 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:20:48,943 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:48,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:20:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-15 16:20:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-15 16:20:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.375) internal successors, (55), 50 states have internal predecessors, (55), 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:20:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-10-15 16:20:48,951 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 9 [2022-10-15 16:20:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:48,951 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-10-15 16:20:48,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:20:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-10-15 16:20:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:20:48,953 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:48,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:48,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:20:48,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1268642444, now seen corresponding path program 1 times [2022-10-15 16:20:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:48,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179151984] [2022-10-15 16:20:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:49,208 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:20:49,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179151984] [2022-10-15 16:20:49,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179151984] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:49,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:49,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:20:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076931523] [2022-10-15 16:20:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:49,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:20:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:20:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:20:49,213 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:20:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:49,369 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-10-15 16:20:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:20:49,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-10-15 16:20:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:49,371 INFO L225 Difference]: With dead ends: 83 [2022-10-15 16:20:49,371 INFO L226 Difference]: Without dead ends: 83 [2022-10-15 16:20:49,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:20:49,373 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 207 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:49,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 34 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-15 16:20:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2022-10-15 16:20:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 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:20:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-10-15 16:20:49,383 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 9 [2022-10-15 16:20:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:49,383 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-10-15 16:20:49,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:20:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-10-15 16:20:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:20:49,385 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:49,385 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:49,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:20:49,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1585184552, now seen corresponding path program 1 times [2022-10-15 16:20:49,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838745465] [2022-10-15 16:20:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:49,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838745465] [2022-10-15 16:20:49,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838745465] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:49,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596105299] [2022-10-15 16:20:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:49,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:49,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:49,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:49,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 16:20:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:49,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:20:49,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:49,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:20:49,835 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-10-15 16:20:49,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2022-10-15 16:20:49,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-10-15 16:20:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:50,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:20:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:50,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596105299] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:20:50,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:20:50,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-15 16:20:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131170931] [2022-10-15 16:20:50,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:20:50,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:20:50,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:20:50,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:20:50,425 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 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:20:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:50,716 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-10-15 16:20:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:20:50,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:20:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:50,719 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:20:50,719 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:20:50,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:20:50,726 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:50,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 67 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:20:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:20:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2022-10-15 16:20:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 50 states have internal predecessors, (55), 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:20:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-10-15 16:20:50,747 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2022-10-15 16:20:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:50,748 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-10-15 16:20:50,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 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:20:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-10-15 16:20:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:20:50,749 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:50,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:50,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:20:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 16:20:50,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -826725937, now seen corresponding path program 1 times [2022-10-15 16:20:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:50,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318364239] [2022-10-15 16:20:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:20:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:51,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318364239] [2022-10-15 16:20:51,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318364239] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:51,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:51,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216123607] [2022-10-15 16:20:51,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:51,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:51,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:51,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:51,047 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:20:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:51,072 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-10-15 16:20:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2022-10-15 16:20:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:51,073 INFO L225 Difference]: With dead ends: 49 [2022-10-15 16:20:51,074 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 16:20:51,074 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:20:51,075 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:51,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:20:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 16:20:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-15 16:20:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 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:20:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-10-15 16:20:51,085 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 31 [2022-10-15 16:20:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:51,086 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-10-15 16:20:51,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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:20:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-10-15 16:20:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:20:51,087 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:51,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:51,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:20:51,091 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash -826725936, now seen corresponding path program 1 times [2022-10-15 16:20:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:51,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248058576] [2022-10-15 16:20:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:20:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:51,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248058576] [2022-10-15 16:20:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248058576] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:51,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:51,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:20:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532339017] [2022-10-15 16:20:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:20:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:51,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:20:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:20:51,386 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:20:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:51,495 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-10-15 16:20:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:20:51,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2022-10-15 16:20:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:51,508 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:20:51,508 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 16:20:51,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:20:51,511 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 143 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:51,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 30 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 16:20:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2022-10-15 16:20:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 51 states have internal predecessors, (56), 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:20:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-10-15 16:20:51,526 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 31 [2022-10-15 16:20:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:51,527 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-10-15 16:20:51,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:20:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-10-15 16:20:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:20:51,528 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:51,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:51,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:20:51,532 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -659383152, now seen corresponding path program 1 times [2022-10-15 16:20:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:51,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892550065] [2022-10-15 16:20:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:20:51,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:51,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892550065] [2022-10-15 16:20:51,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892550065] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:51,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361080102] [2022-10-15 16:20:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:51,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:51,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:51,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 16:20:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 16:20:51,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:20:51,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:20:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:20:51,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361080102] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:20:51,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:20:51,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-10-15 16:20:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374894839] [2022-10-15 16:20:51,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:20:51,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:20:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:20:51,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:20:51,959 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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:20:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:52,193 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2022-10-15 16:20:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:20:52,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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 36 [2022-10-15 16:20:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:52,195 INFO L225 Difference]: With dead ends: 144 [2022-10-15 16:20:52,195 INFO L226 Difference]: Without dead ends: 144 [2022-10-15 16:20:52,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:20:52,199 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 167 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:52,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 124 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:20:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-15 16:20:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-10-15 16:20:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.134020618556701) internal successors, (110), 100 states have internal predecessors, (110), 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:20:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-10-15 16:20:52,207 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 36 [2022-10-15 16:20:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:52,207 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-10-15 16:20:52,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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:20:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-10-15 16:20:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:20:52,209 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:52,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:52,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:20:52,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 16:20:52,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:20:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2041054806, now seen corresponding path program 1 times [2022-10-15 16:20:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:52,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937112945] [2022-10-15 16:20:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:20:52,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:20:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:20:52,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:20:52,551 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:20:52,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-10-15 16:20:52,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2022-10-15 16:20:52,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-10-15 16:20:52,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-10-15 16:20:52,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-10-15 16:20:52,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-10-15 16:20:52,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-10-15 16:20:52,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-10-15 16:20:52,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-10-15 16:20:52,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-10-15 16:20:52,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-10-15 16:20:52,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-10-15 16:20:52,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-10-15 16:20:52,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-10-15 16:20:52,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-10-15 16:20:52,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-10-15 16:20:52,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-10-15 16:20:52,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-10-15 16:20:52,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2022-10-15 16:20:52,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2022-10-15 16:20:52,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2022-10-15 16:20:52,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2022-10-15 16:20:52,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2022-10-15 16:20:52,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2022-10-15 16:20:52,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:20:52,566 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:52,571 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:20:52,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:20:52 BoogieIcfgContainer [2022-10-15 16:20:52,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:20:52,666 INFO L158 Benchmark]: Toolchain (without parser) took 6780.44ms. Allocated memory was 162.5MB in the beginning and 203.4MB in the end (delta: 40.9MB). Free memory was 138.1MB in the beginning and 154.9MB in the end (delta: -16.8MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. [2022-10-15 16:20:52,667 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 162.5MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:20:52,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.07ms. Allocated memory is still 162.5MB. Free memory was 137.8MB in the beginning and 127.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 16:20:52,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.03ms. Allocated memory is still 162.5MB. Free memory was 127.3MB in the beginning and 125.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:20:52,668 INFO L158 Benchmark]: Boogie Preprocessor took 39.86ms. Allocated memory is still 162.5MB. Free memory was 125.6MB in the beginning and 124.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:20:52,669 INFO L158 Benchmark]: RCFGBuilder took 868.00ms. Allocated memory is still 162.5MB. Free memory was 124.2MB in the beginning and 144.9MB in the end (delta: -20.7MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2022-10-15 16:20:52,670 INFO L158 Benchmark]: TraceAbstraction took 5523.46ms. Allocated memory was 162.5MB in the beginning and 203.4MB in the end (delta: 40.9MB). Free memory was 144.4MB in the beginning and 154.9MB in the end (delta: -10.5MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2022-10-15 16:20:52,676 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.28ms. Allocated memory is still 162.5MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.07ms. Allocated memory is still 162.5MB. Free memory was 137.8MB in the beginning and 127.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.03ms. Allocated memory is still 162.5MB. Free memory was 127.3MB in the beginning and 125.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 39.86ms. Allocated memory is still 162.5MB. Free memory was 125.6MB in the beginning and 124.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 868.00ms. Allocated memory is still 162.5MB. Free memory was 124.2MB in the beginning and 144.9MB in the end (delta: -20.7MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5523.46ms. Allocated memory was 162.5MB in the beginning and 203.4MB in the end (delta: 40.9MB). Free memory was 144.4MB in the beginning and 154.9MB in the end (delta: -10.5MB). Peak memory consumption was 29.9MB. 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: 15]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 15. Possible FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] long long *a = malloc(sizeof(long long)*N); [L30] long long *b = malloc(sizeof(long long)*N); [L32] sum[0] = 0 VAL [a={-2:0}, b={-1:0}, N=1, sum={4:0}] [L33] i=0 VAL [a={-2:0}, b={-1:0}, i=0, N=1, sum={4:0}] [L33] COND TRUE i