./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefInLoop1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/derefInLoop1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa3ae4378a5284e50be7191d52900376e96b0fdc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:17:17,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:17,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:17,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:17,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:17,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:17,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:17,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:17,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:17,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:17,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:17,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:17,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:17,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:17,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:17,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:17,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:17,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:17,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:17,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:17,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:17,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:17,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:17,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:17,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:17,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:17,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:17,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:17,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:17,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:17,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:17,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:17,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:17,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:17,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:17,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:17,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:17,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:17,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:17,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:17,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:17,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:17:17,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:17,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:17,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:17,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:17,265 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:17,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:17,265 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:17:17,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:17,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:17,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:17:17,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:17,268 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:17,268 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:17,269 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:17,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:17,269 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:17,269 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:17:17,270 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:17,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:17,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:17,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:17,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:17,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:17,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:17,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:17,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:17,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:17,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:17,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa3ae4378a5284e50be7191d52900376e96b0fdc [2020-07-29 01:17:17,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:17,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:17,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:17,593 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:17,593 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:17,594 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefInLoop1.c [2020-07-29 01:17:17,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cc884db/d073ef4cbe0a46948ac6326124ff4e11/FLAGb1e2404b5 [2020-07-29 01:17:18,116 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:18,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefInLoop1.c [2020-07-29 01:17:18,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cc884db/d073ef4cbe0a46948ac6326124ff4e11/FLAGb1e2404b5 [2020-07-29 01:17:18,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cc884db/d073ef4cbe0a46948ac6326124ff4e11 [2020-07-29 01:17:18,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:18,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:18,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:18,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:18,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7337b255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:18,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:18,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,739 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:18,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,774 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:18,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18 WrapperNode [2020-07-29 01:17:18,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:18,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:18,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:18,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:18,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:18,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:17:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:19,220 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:19,220 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:17:19,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:19 BoogieIcfgContainer [2020-07-29 01:17:19,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:19,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:19,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:19,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:19,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:17:18" (1/3) ... [2020-07-29 01:17:19,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c243bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:19, skipping insertion in model container [2020-07-29 01:17:19,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (2/3) ... [2020-07-29 01:17:19,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c243bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:19, skipping insertion in model container [2020-07-29 01:17:19,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:19" (3/3) ... [2020-07-29 01:17:19,235 INFO L109 eAbstractionObserver]: Analyzing ICFG derefInLoop1.c [2020-07-29 01:17:19,247 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:19,256 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-29 01:17:19,277 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-29 01:17:19,299 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:19,300 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:19,300 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:19,301 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:19,301 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:19,301 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:19,302 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:19,302 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-29 01:17:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:17:19,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:19,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:19,334 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:19,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1075805963, now seen corresponding path program 1 times [2020-07-29 01:17:19,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:19,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218621144] [2020-07-29 01:17:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-29 01:17:19,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-29 01:17:19,607 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #31#return; {21#true} is VALID [2020-07-29 01:17:19,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:19,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-29 01:17:19,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-29 01:17:19,613 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #31#return; {21#true} is VALID [2020-07-29 01:17:19,613 INFO L263 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2020-07-29 01:17:19,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} havoc ~p~0.base, ~p~0.offset;~i~0 := 0; {21#true} is VALID [2020-07-29 01:17:19,616 INFO L280 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2020-07-29 01:17:19,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {22#false} #res := 0; {22#false} is VALID [2020-07-29 01:17:19,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {22#false} assume !(#valid == old(#valid)); {22#false} is VALID [2020-07-29 01:17:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:19,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218621144] [2020-07-29 01:17:19,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:19,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:19,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469567560] [2020-07-29 01:17:19,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-29 01:17:19,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:19,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:17:19,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:17:19,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:17:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:17:19,677 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-07-29 01:17:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,798 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-29 01:17:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:17:19,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-29 01:17:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:17:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-29 01:17:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:17:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-29 01:17:19,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-29 01:17:19,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,880 INFO L225 Difference]: With dead ends: 21 [2020-07-29 01:17:19,880 INFO L226 Difference]: Without dead ends: 16 [2020-07-29 01:17:19,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:17:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-29 01:17:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:17:19,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:19,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-29 01:17:19,915 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 01:17:19,915 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 01:17:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,920 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-29 01:17:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-29 01:17:19,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,921 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 01:17:19,922 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 01:17:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,926 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-29 01:17:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-29 01:17:19,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:19,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:17:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-07-29 01:17:19,932 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2020-07-29 01:17:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:19,933 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-07-29 01:17:19,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:17:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-29 01:17:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:17:19,934 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:19,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:19,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:17:19,935 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1075817783, now seen corresponding path program 1 times [2020-07-29 01:17:19,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:19,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383688875] [2020-07-29 01:17:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-29 01:17:20,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-29 01:17:20,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98#true} {98#true} #31#return; {98#true} is VALID [2020-07-29 01:17:20,037 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {104#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:20,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-29 01:17:20,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-29 01:17:20,038 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #31#return; {98#true} is VALID [2020-07-29 01:17:20,039 INFO L263 TraceCheckUtils]: 4: Hoare triple {98#true} call #t~ret1 := main(); {98#true} is VALID [2020-07-29 01:17:20,040 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#true} havoc ~p~0.base, ~p~0.offset;~i~0 := 0; {103#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:20,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {103#(= 0 main_~i~0)} assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40); {103#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:20,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {103#(= 0 main_~i~0)} assume !(0 == ~i~0); {99#false} is VALID [2020-07-29 01:17:20,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} assume !(1 == #valid[~p~0.base]); {99#false} is VALID [2020-07-29 01:17:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383688875] [2020-07-29 01:17:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:17:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843315008] [2020-07-29 01:17:20,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:17:20,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:20,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:20,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:20,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:20,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:20,062 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2020-07-29 01:17:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,154 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-29 01:17:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:20,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 01:17:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 01:17:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 01:17:20,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2020-07-29 01:17:20,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,191 INFO L225 Difference]: With dead ends: 18 [2020-07-29 01:17:20,192 INFO L226 Difference]: Without dead ends: 18 [2020-07-29 01:17:20,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-29 01:17:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 01:17:20,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-29 01:17:20,196 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-29 01:17:20,197 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-29 01:17:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,199 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-29 01:17:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-29 01:17:20,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,200 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-29 01:17:20,201 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-29 01:17:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,203 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-29 01:17:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-29 01:17:20,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:17:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-07-29 01:17:20,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2020-07-29 01:17:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,208 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-29 01:17:20,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-29 01:17:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:20,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:17:20,210 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash -643356833, now seen corresponding path program 1 times [2020-07-29 01:17:20,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391913436] [2020-07-29 01:17:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {180#true} is VALID [2020-07-29 01:17:20,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-29 01:17:20,330 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #31#return; {180#true} is VALID [2020-07-29 01:17:20,332 INFO L263 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:20,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {180#true} is VALID [2020-07-29 01:17:20,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-29 01:17:20,334 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #31#return; {180#true} is VALID [2020-07-29 01:17:20,334 INFO L263 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret1 := main(); {180#true} is VALID [2020-07-29 01:17:20,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~p~0.base, ~p~0.offset;~i~0 := 0; {185#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:20,337 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#(= 0 main_~i~0)} assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40); {185#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:20,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#(= 0 main_~i~0)} assume 0 == ~i~0;~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; {185#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:20,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {186#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:20,343 INFO L280 TraceCheckUtils]: 9: Hoare triple {186#(<= main_~i~0 1)} assume !(~i~0 < 2); {181#false} is VALID [2020-07-29 01:17:20,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#false} #res := 0; {181#false} is VALID [2020-07-29 01:17:20,344 INFO L280 TraceCheckUtils]: 11: Hoare triple {181#false} assume !(#valid == old(#valid)); {181#false} is VALID [2020-07-29 01:17:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391913436] [2020-07-29 01:17:20,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2657504] [2020-07-29 01:17:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:17:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:20,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2020-07-29 01:17:20,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {180#true} is VALID [2020-07-29 01:17:20,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-29 01:17:20,568 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #31#return; {180#true} is VALID [2020-07-29 01:17:20,568 INFO L263 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret1 := main(); {180#true} is VALID [2020-07-29 01:17:20,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~p~0.base, ~p~0.offset;~i~0 := 0; {206#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:20,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {206#(<= main_~i~0 0)} assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(40); {206#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:20,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {206#(<= main_~i~0 0)} assume 0 == ~i~0;~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; {206#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:20,576 INFO L280 TraceCheckUtils]: 8: Hoare triple {206#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; {186#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:20,578 INFO L280 TraceCheckUtils]: 9: Hoare triple {186#(<= main_~i~0 1)} assume !(~i~0 < 2); {181#false} is VALID [2020-07-29 01:17:20,578 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#false} #res := 0; {181#false} is VALID [2020-07-29 01:17:20,579 INFO L280 TraceCheckUtils]: 11: Hoare triple {181#false} assume !(#valid == old(#valid)); {181#false} is VALID [2020-07-29 01:17:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:20,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-29 01:17:20,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857529970] [2020-07-29 01:17:20,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 01:17:20,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:20,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:20,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:20,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:20,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:20,624 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2020-07-29 01:17:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,844 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-29 01:17:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:17:20,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 01:17:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-07-29 01:17:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-07-29 01:17:20,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2020-07-29 01:17:20,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,879 INFO L225 Difference]: With dead ends: 19 [2020-07-29 01:17:20,879 INFO L226 Difference]: Without dead ends: 19 [2020-07-29 01:17:20,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:17:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-29 01:17:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 01:17:20,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,883 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,883 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,885 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-29 01:17:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-29 01:17:20,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,886 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,887 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,888 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-29 01:17:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-29 01:17:20,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:17:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-29 01:17:20,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2020-07-29 01:17:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,892 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-29 01:17:20,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-29 01:17:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:20,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,893 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:21,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:17:21,110 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash -643355199, now seen corresponding path program 1 times [2020-07-29 01:17:21,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:21,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664678459] [2020-07-29 01:17:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:21,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:21,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:21,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:17:21,174 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:17:21,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:17:21,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:17:21 BoogieIcfgContainer [2020-07-29 01:17:21,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:17:21,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:17:21,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:17:21,204 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:17:21,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:19" (3/4) ... [2020-07-29 01:17:21,208 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:17:21,260 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:17:21,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:17:21,264 INFO L168 Benchmark]: Toolchain (without parser) took 2739.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 952.2 MB in the beginning and 965.8 MB in the end (delta: -13.6 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:21,264 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:21,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.20 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:21,266 INFO L168 Benchmark]: Boogie Preprocessor took 90.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:21,267 INFO L168 Benchmark]: RCFGBuilder took 358.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:21,268 INFO L168 Benchmark]: TraceAbstraction took 1976.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.4 MB in the end (delta: 138.4 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:21,268 INFO L168 Benchmark]: Witness Printer took 56.73 ms. Allocated memory is still 1.2 GB. Free memory was 972.4 MB in the beginning and 965.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:21,272 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.20 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 358.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1976.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.4 MB in the end (delta: 138.4 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. * Witness Printer took 56.73 ms. Allocated memory is still 1.2 GB. Free memory was 972.4 MB in the beginning and 965.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={3:0}, i=0] [L5] COND TRUE i == 0 [L6] p = a VAL [a={3:0}, i=0, p={3:0}] [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={2:0}, i=1, p={3:0}] [L5] COND FALSE !(i == 0) VAL [a={2:0}, i=1, p={3:0}] [L8] p[0] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 SDtfs, 13 SDslu, 34 SDs, 0 SdLazy, 62 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 821 SizeOfPredicates, 1 NumberOfNonLiveVariables, 52 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2 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 proved your program to be incorrect! Received shutdown request...