/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/double_req_bl_1072b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:18:44,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:18:44,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:18:44,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:18:44,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:18:44,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:18:44,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:18:44,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:18:44,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:18:44,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:18:44,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:18:44,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:18:44,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:18:44,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:18:44,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:18:44,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:18:44,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:18:44,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:18:44,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:18:44,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:18:44,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:18:44,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:18:44,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:18:44,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:18:44,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:18:44,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:18:44,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:18:44,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:18:44,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:18:44,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:18:44,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:18:44,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:18:44,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:18:44,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:18:44,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:18:44,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:18:44,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:18:44,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:18:44,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:18:44,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:18:44,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:18:44,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-16 01:18:44,398 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:18:44,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:18:44,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:18:44,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:18:44,400 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:18:44,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:18:44,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:18:44,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:18:44,401 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:18:44,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:18:44,402 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:18:44,402 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:18:44,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:18:44,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:18:44,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:18:44,403 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:18:44,403 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:18:44,403 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:18:44,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:18:44,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:18:44,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:18:44,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:18:44,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:18:44,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:18:44,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:18:44,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:18:44,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:18:44,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:18:44,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:18:44,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:18:44,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 01:18:44,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:18:44,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:18:44,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:18:44,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:18:44,847 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:18:44,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1072b.c [2022-10-16 01:18:44,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb53c726e/032d92379c934b8a8091958df18e9c93/FLAG7c2993b95 [2022-10-16 01:18:45,557 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:18:45,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1072b.c [2022-10-16 01:18:45,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb53c726e/032d92379c934b8a8091958df18e9c93/FLAG7c2993b95 [2022-10-16 01:18:45,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb53c726e/032d92379c934b8a8091958df18e9c93 [2022-10-16 01:18:45,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:18:45,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:18:45,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:18:45,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:18:45,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:18:45,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:45" (1/1) ... [2022-10-16 01:18:45,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698e2c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:45, skipping insertion in model container [2022-10-16 01:18:45,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:45" (1/1) ... [2022-10-16 01:18:45,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:18:45,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:18:46,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1072b.c[2110,2123] [2022-10-16 01:18:46,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:18:46,177 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:18:46,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1072b.c[2110,2123] [2022-10-16 01:18:46,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:18:46,227 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:18:46,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46 WrapperNode [2022-10-16 01:18:46,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:18:46,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:18:46,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:18:46,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:18:46,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,287 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2022-10-16 01:18:46,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:18:46,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:18:46,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:18:46,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:18:46,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,329 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:18:46,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:18:46,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:18:46,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:18:46,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (1/1) ... [2022-10-16 01:18:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:18:46,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:18:46,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 01:18:46,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 01:18:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:18:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:18:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 01:18:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 01:18:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:18:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 01:18:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:18:46,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:18:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:18:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:18:46,642 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:18:46,645 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:18:47,245 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:18:47,254 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:18:47,254 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-10-16 01:18:47,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:47 BoogieIcfgContainer [2022-10-16 01:18:47,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:18:47,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:18:47,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:18:47,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:18:47,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:18:45" (1/3) ... [2022-10-16 01:18:47,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf9a1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:47, skipping insertion in model container [2022-10-16 01:18:47,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:46" (2/3) ... [2022-10-16 01:18:47,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf9a1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:47, skipping insertion in model container [2022-10-16 01:18:47,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:47" (3/3) ... [2022-10-16 01:18:47,267 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072b.c [2022-10-16 01:18:47,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:18:47,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-10-16 01:18:47,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:18:47,358 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;@1d575dff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:18:47,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-10-16 01:18:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 2.0) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 01:18:47,371 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:47,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 01:18:47,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-16 01:18:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:47,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828779471] [2022-10-16 01:18:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:47,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828779471] [2022-10-16 01:18:47,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828779471] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:47,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:47,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037114836] [2022-10-16 01:18:47,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:47,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:47,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:47,671 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 2.0) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:47,780 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-10-16 01:18:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 01:18:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:47,793 INFO L225 Difference]: With dead ends: 78 [2022-10-16 01:18:47,794 INFO L226 Difference]: Without dead ends: 76 [2022-10-16 01:18:47,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:47,800 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:47,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 118 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-16 01:18:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-10-16 01:18:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-10-16 01:18:47,845 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 4 [2022-10-16 01:18:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:47,845 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-10-16 01:18:47,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-10-16 01:18:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 01:18:47,846 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:47,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 01:18:47,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:18:47,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-16 01:18:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:47,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865530464] [2022-10-16 01:18:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:47,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865530464] [2022-10-16 01:18:47,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865530464] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:47,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:47,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445378624] [2022-10-16 01:18:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:47,962 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:48,031 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-10-16 01:18:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 01:18:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:48,033 INFO L225 Difference]: With dead ends: 73 [2022-10-16 01:18:48,034 INFO L226 Difference]: Without dead ends: 73 [2022-10-16 01:18:48,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,036 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:48,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-16 01:18:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-10-16 01:18:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-10-16 01:18:48,047 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 4 [2022-10-16 01:18:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:48,047 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-10-16 01:18:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-10-16 01:18:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:18:48,049 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:48,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:48,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:18:48,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash 904874947, now seen corresponding path program 1 times [2022-10-16 01:18:48,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:48,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412695972] [2022-10-16 01:18:48,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:48,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:48,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412695972] [2022-10-16 01:18:48,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412695972] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:48,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:48,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066285867] [2022-10-16 01:18:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:48,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:48,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:48,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,252 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:48,355 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-10-16 01:18:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 01:18:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:48,357 INFO L225 Difference]: With dead ends: 70 [2022-10-16 01:18:48,358 INFO L226 Difference]: Without dead ends: 70 [2022-10-16 01:18:48,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,360 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:48,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-16 01:18:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-16 01:18:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-10-16 01:18:48,370 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2022-10-16 01:18:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:48,370 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-10-16 01:18:48,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-10-16 01:18:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:18:48,372 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:48,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:48,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:18:48,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash 904874948, now seen corresponding path program 1 times [2022-10-16 01:18:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:48,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101750547] [2022-10-16 01:18:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:48,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101750547] [2022-10-16 01:18:48,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101750547] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:48,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:48,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844294221] [2022-10-16 01:18:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:48,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,526 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:48,630 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-10-16 01:18:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 01:18:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:48,637 INFO L225 Difference]: With dead ends: 67 [2022-10-16 01:18:48,637 INFO L226 Difference]: Without dead ends: 67 [2022-10-16 01:18:48,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,640 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:48,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-16 01:18:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-10-16 01:18:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.489795918367347) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-10-16 01:18:48,655 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 15 [2022-10-16 01:18:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:48,655 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-10-16 01:18:48,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-10-16 01:18:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:18:48,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:48,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:48,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:18:48,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 904898779, now seen corresponding path program 1 times [2022-10-16 01:18:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468982695] [2022-10-16 01:18:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:48,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468982695] [2022-10-16 01:18:48,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468982695] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:48,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:48,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072564499] [2022-10-16 01:18:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:48,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:48,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,755 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:48,816 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-10-16 01:18:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 01:18:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:48,818 INFO L225 Difference]: With dead ends: 64 [2022-10-16 01:18:48,818 INFO L226 Difference]: Without dead ends: 64 [2022-10-16 01:18:48,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:48,821 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:48,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-16 01:18:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-16 01:18:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-10-16 01:18:48,829 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-10-16 01:18:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:48,830 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-10-16 01:18:48,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-10-16 01:18:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:18:48,831 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:48,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:48,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:18:48,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash 904898780, now seen corresponding path program 1 times [2022-10-16 01:18:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:48,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016881124] [2022-10-16 01:18:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016881124] [2022-10-16 01:18:49,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016881124] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:49,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:49,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036188444] [2022-10-16 01:18:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:49,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:49,010 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:49,075 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-10-16 01:18:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 01:18:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:49,077 INFO L225 Difference]: With dead ends: 61 [2022-10-16 01:18:49,078 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 01:18:49,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:49,079 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:49,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 01:18:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 01:18:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 60 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-16 01:18:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-10-16 01:18:49,087 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 15 [2022-10-16 01:18:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:49,088 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-10-16 01:18:49,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-10-16 01:18:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:18:49,089 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:49,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:49,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:18:49,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash 906451882, now seen corresponding path program 1 times [2022-10-16 01:18:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:49,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154326352] [2022-10-16 01:18:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:49,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:49,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154326352] [2022-10-16 01:18:49,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154326352] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:49,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:49,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964991132] [2022-10-16 01:18:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:49,221 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:49,272 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-10-16 01:18:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:49,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 01:18:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:49,274 INFO L225 Difference]: With dead ends: 58 [2022-10-16 01:18:49,274 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 01:18:49,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:49,276 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:49,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 01:18:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-10-16 01:18:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 57 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-16 01:18:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-10-16 01:18:49,283 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 15 [2022-10-16 01:18:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:49,283 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-10-16 01:18:49,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-10-16 01:18:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 01:18:49,285 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:49,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:49,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:18:49,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 906451883, now seen corresponding path program 1 times [2022-10-16 01:18:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:49,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217701011] [2022-10-16 01:18:49,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:49,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217701011] [2022-10-16 01:18:49,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217701011] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:49,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:49,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712494850] [2022-10-16 01:18:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:49,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:49,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:49,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:49,401 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:49,454 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-10-16 01:18:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 01:18:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:49,456 INFO L225 Difference]: With dead ends: 55 [2022-10-16 01:18:49,456 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 01:18:49,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:49,457 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:49,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 01:18:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-10-16 01:18:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-10-16 01:18:49,463 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 15 [2022-10-16 01:18:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:49,463 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-10-16 01:18:49,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-10-16 01:18:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 01:18:49,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:49,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:49,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 01:18:49,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1441562502, now seen corresponding path program 1 times [2022-10-16 01:18:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:49,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143724227] [2022-10-16 01:18:49,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143724227] [2022-10-16 01:18:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143724227] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:49,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:18:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510791984] [2022-10-16 01:18:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:49,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:18:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:18:49,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:18:49,526 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:49,568 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-10-16 01:18:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:18:49,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-10-16 01:18:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:49,570 INFO L225 Difference]: With dead ends: 83 [2022-10-16 01:18:49,570 INFO L226 Difference]: Without dead ends: 83 [2022-10-16 01:18:49,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:18:49,571 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 55 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:49,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 178 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-16 01:18:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2022-10-16 01:18:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 57 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-16 01:18:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-10-16 01:18:49,578 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 18 [2022-10-16 01:18:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:49,578 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-10-16 01:18:49,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-10-16 01:18:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 01:18:49,580 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:49,580 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] [2022-10-16 01:18:49,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 01:18:49,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-16 01:18:49,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:49,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1692373848, now seen corresponding path program 1 times [2022-10-16 01:18:49,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:49,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345928441] [2022-10-16 01:18:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:18:49,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:18:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:18:49,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:18:49,642 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:18:49,644 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (29 of 30 remaining) [2022-10-16 01:18:49,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2022-10-16 01:18:49,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2022-10-16 01:18:49,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2022-10-16 01:18:49,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2022-10-16 01:18:49,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2022-10-16 01:18:49,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2022-10-16 01:18:49,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2022-10-16 01:18:49,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2022-10-16 01:18:49,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2022-10-16 01:18:49,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2022-10-16 01:18:49,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2022-10-16 01:18:49,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2022-10-16 01:18:49,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2022-10-16 01:18:49,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2022-10-16 01:18:49,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2022-10-16 01:18:49,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2022-10-16 01:18:49,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2022-10-16 01:18:49,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2022-10-16 01:18:49,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2022-10-16 01:18:49,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2022-10-16 01:18:49,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2022-10-16 01:18:49,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2022-10-16 01:18:49,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2022-10-16 01:18:49,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2022-10-16 01:18:49,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2022-10-16 01:18:49,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2022-10-16 01:18:49,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2022-10-16 01:18:49,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2022-10-16 01:18:49,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2022-10-16 01:18:49,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 01:18:49,657 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:49,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:18:49,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:18:49 BoogieIcfgContainer [2022-10-16 01:18:49,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:18:49,713 INFO L158 Benchmark]: Toolchain (without parser) took 3791.38ms. Allocated memory was 157.3MB in the beginning and 206.6MB in the end (delta: 49.3MB). Free memory was 131.9MB in the beginning and 101.5MB in the end (delta: 30.4MB). Peak memory consumption was 80.6MB. Max. memory is 8.0GB. [2022-10-16 01:18:49,714 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 157.3MB. Free memory was 127.1MB in the beginning and 127.0MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:18:49,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.97ms. Allocated memory is still 157.3MB. Free memory was 131.7MB in the beginning and 120.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-16 01:18:49,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.21ms. Allocated memory is still 157.3MB. Free memory was 120.3MB in the beginning and 117.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:49,715 INFO L158 Benchmark]: Boogie Preprocessor took 47.77ms. Allocated memory is still 157.3MB. Free memory was 117.4MB in the beginning and 115.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:49,716 INFO L158 Benchmark]: RCFGBuilder took 919.76ms. Allocated memory is still 157.3MB. Free memory was 114.9MB in the beginning and 128.8MB in the end (delta: -13.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-10-16 01:18:49,716 INFO L158 Benchmark]: TraceAbstraction took 2453.32ms. Allocated memory was 157.3MB in the beginning and 206.6MB in the end (delta: 49.3MB). Free memory was 128.2MB in the beginning and 101.5MB in the end (delta: 26.7MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:49,720 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.23ms. Allocated memory is still 157.3MB. Free memory was 127.1MB in the beginning and 127.0MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.97ms. Allocated memory is still 157.3MB. Free memory was 131.7MB in the beginning and 120.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.21ms. Allocated memory is still 157.3MB. Free memory was 120.3MB in the beginning and 117.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.77ms. Allocated memory is still 157.3MB. Free memory was 117.4MB in the beginning and 115.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 919.76ms. Allocated memory is still 157.3MB. Free memory was 114.9MB in the beginning and 128.8MB in the end (delta: -13.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2453.32ms. Allocated memory was 157.3MB in the beginning and 206.6MB in the end (delta: 49.3MB). Free memory was 128.2MB in the beginning and 101.5MB in the end (delta: 26.7MB). Peak memory consumption was 77.1MB. 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: 88]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of memtrack at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L83] double x = 0.0; [L84] CALL, EXPR trunc_double(x) [L20] int signbit; [L21] int msw; [L22] unsigned int lsw; [L23] int exponent_less_1023; VAL [\old(x)=0, x=0] [L25] ieee_double_shape_type ew_u; VAL [\old(x)=0, ew_u={5:0}, x=0] [L26] ew_u.value = (x) VAL [\old(x)=0, ew_u={5:0}, x=0] [L27] EXPR ew_u.parts.msw VAL [\old(x)=0, ew_u={5:0}, ew_u.parts.msw=6442450943, x=0] [L27] (msw) = ew_u.parts.msw [L28] EXPR ew_u.parts.lsw VAL [\old(x)=0, ew_u={5:0}, ew_u.parts.lsw=6442450944, msw=2147483647, x=0] [L28] (lsw) = ew_u.parts.lsw [L30] signbit = msw & 0x80000000 VAL [\old(x)=0, lsw=2147483648, msw=2147483647, signbit=2147483646, signbit = msw & 0x80000000=2147483647, x=0] [L31] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483648, msw=2147483647, signbit=2147483646, signbit = msw & 0x80000000=2147483647, x=0] [L32] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483648, msw=2147483647, signbit=2147483646, signbit = msw & 0x80000000=2147483647, x=0] [L49] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483648, msw=2147483647, signbit=2147483646, signbit = msw & 0x80000000=2147483647, x=0] [L50] COND TRUE exponent_less_1023 == 1024 [L51] return x + x; VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483648, msw=2147483647, signbit=2147483646, signbit = msw & 0x80000000=2147483647, x=0] [L84] RET, EXPR trunc_double(x) [L84] double res = trunc_double(x); [L87] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=6442450952, res == 0.0 && __signbit_double(res) == 0=0, signbit = msw & 0x80000000=2147483647, x=0] [L87] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L88] reach_error() VAL [res=6442450952, signbit = msw & 0x80000000=2147483647, x=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 81 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 412 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 607 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 01:18:49,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...