./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree1.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/derefAfterFree1.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 d452f938d74713dbff7e0330f8ef393409d67ffe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:16,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:16,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:16,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:16,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:16,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:16,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:16,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:16,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:16,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:16,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:16,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:16,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:16,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:16,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:16,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:16,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:16,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:16,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:16,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:16,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:16,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:16,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:16,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:16,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:16,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:16,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:16,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:16,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:16,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:16,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:16,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:16,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:16,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:16,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:16,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:16,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:16,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:16,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:16,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:16,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:16,786 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:16,803 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:16,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:16,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:16,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:16,805 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:16,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:16,805 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:17:16,805 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:16,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:16,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:17:16,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:16,806 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:16,806 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:16,807 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:16,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:16,807 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:16,807 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:17:16,807 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:16,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:16,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:16,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:16,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:16,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:16,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:16,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:16,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:16,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:16,810 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:16,810 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 -> d452f938d74713dbff7e0330f8ef393409d67ffe [2020-07-29 01:17:17,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:17,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:17,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:17,156 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:17,158 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:17,160 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree1.c [2020-07-29 01:17:17,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943d68c00/0060249c8f17460da6123a068b10be53/FLAG73eef159a [2020-07-29 01:17:17,722 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:17,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree1.c [2020-07-29 01:17:17,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943d68c00/0060249c8f17460da6123a068b10be53/FLAG73eef159a [2020-07-29 01:17:18,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943d68c00/0060249c8f17460da6123a068b10be53 [2020-07-29 01:17:18,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:18,072 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:18,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:18,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:18,079 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,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4726e3cf 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,082 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,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:18,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:18,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,288 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:18,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,327 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:18,328 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,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:18,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:18,340 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,340 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,401 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,402 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,410 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,411 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,412 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,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:18,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:18,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:18,416 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,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure freePointer [2020-07-29 01:17:18,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:18,480 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:17:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:17:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure freePointer [2020-07-29 01:17:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:17:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:18,805 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:18,805 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-29 01:17:18,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:18 BoogieIcfgContainer [2020-07-29 01:17:18,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:18,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:18,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:18,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:18,816 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:18,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb24260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,817 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:18,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb24260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:18" (3/3) ... [2020-07-29 01:17:18,820 INFO L109 eAbstractionObserver]: Analyzing ICFG derefAfterFree1.c [2020-07-29 01:17:18,832 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:18,840 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-29 01:17:18,853 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-29 01:17:18,874 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:18,874 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:18,875 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:18,875 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:18,875 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:18,875 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:18,875 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:18,875 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-29 01:17:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 01:17:18,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:18,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:18,901 INFO L427 AbstractCegarLoop]: === Iteration 1 === [freePointerErr2ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1608321379, now seen corresponding path program 1 times [2020-07-29 01:17:18,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:18,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131661822] [2020-07-29 01:17:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#(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; {28#true} is VALID [2020-07-29 01:17:19,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-29 01:17:19,194 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #22#return; {28#true} is VALID [2020-07-29 01:17:19,198 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:19,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(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; {28#true} is VALID [2020-07-29 01:17:19,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-29 01:17:19,199 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #22#return; {28#true} is VALID [2020-07-29 01:17:19,200 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret3 := main(); {28#true} is VALID [2020-07-29 01:17:19,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; {33#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:19,204 INFO L263 TraceCheckUtils]: 6: Hoare triple {33#(= 0 main_~p~0.offset)} call freePointer(~p~0.base, ~p~0.offset); {34#(= 0 |freePointer_#in~p.offset|)} is VALID [2020-07-29 01:17:19,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#(= 0 |freePointer_#in~p.offset|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {35#(= freePointer_~p.offset 0)} is VALID [2020-07-29 01:17:19,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#(= freePointer_~p.offset 0)} assume !(0 == ~p.offset); {29#false} is VALID [2020-07-29 01:17:19,208 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,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131661822] [2020-07-29 01:17:19,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:19,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:17:19,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097048135] [2020-07-29 01:17:19,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-29 01:17:19,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:19,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:19,255 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,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:19,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:19,269 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 6 states. [2020-07-29 01:17:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,565 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-29 01:17:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:19,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-29 01:17:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2020-07-29 01:17:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2020-07-29 01:17:19,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2020-07-29 01:17:19,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,665 INFO L225 Difference]: With dead ends: 24 [2020-07-29 01:17:19,666 INFO L226 Difference]: Without dead ends: 21 [2020-07-29 01:17:19,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-29 01:17:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-29 01:17:19,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:19,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-29 01:17:19,716 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-29 01:17:19,717 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-29 01:17:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,726 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-29 01:17:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-29 01:17:19,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,727 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-29 01:17:19,727 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-29 01:17:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,733 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-29 01:17:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-29 01:17:19,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:19,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:17:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2020-07-29 01:17:19,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 9 [2020-07-29 01:17:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:19,743 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2020-07-29 01:17:19,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-29 01:17:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:17:19,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:19,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:19,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:17:19,746 INFO L427 AbstractCegarLoop]: === Iteration 2 === [freePointerErr2ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1681644769, now seen corresponding path program 1 times [2020-07-29 01:17:19,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:19,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298672303] [2020-07-29 01:17:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {142#(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; {134#true} is VALID [2020-07-29 01:17:19,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#true} assume true; {134#true} is VALID [2020-07-29 01:17:19,878 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {134#true} {134#true} #22#return; {134#true} is VALID [2020-07-29 01:17:19,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {134#true} call ULTIMATE.init(); {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:19,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#(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; {134#true} is VALID [2020-07-29 01:17:19,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {134#true} assume true; {134#true} is VALID [2020-07-29 01:17:19,881 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {134#true} {134#true} #22#return; {134#true} is VALID [2020-07-29 01:17:19,881 INFO L263 TraceCheckUtils]: 4: Hoare triple {134#true} call #t~ret3 := main(); {134#true} is VALID [2020-07-29 01:17:19,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {134#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; {139#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:19,885 INFO L263 TraceCheckUtils]: 6: Hoare triple {139#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} call freePointer(~p~0.base, ~p~0.offset); {140#(<= (+ |freePointer_#in~p.base| 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:19,886 INFO L280 TraceCheckUtils]: 7: Hoare triple {140#(<= (+ |freePointer_#in~p.base| 1) |#StackHeapBarrier|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {141#(<= (+ freePointer_~p.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:19,887 INFO L280 TraceCheckUtils]: 8: Hoare triple {141#(<= (+ freePointer_~p.base 1) |#StackHeapBarrier|)} assume 0 == ~p.offset; {141#(<= (+ freePointer_~p.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:19,889 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#(<= (+ freePointer_~p.base 1) |#StackHeapBarrier|)} assume !(~p.base < #StackHeapBarrier); {135#false} is VALID [2020-07-29 01:17:19,890 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,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298672303] [2020-07-29 01:17:19,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:19,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:17:19,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721938998] [2020-07-29 01:17:19,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:17:19,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:19,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:19,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:19,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:19,911 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 6 states. [2020-07-29 01:17:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,132 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-29 01:17:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:17:20,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 01:17:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-29 01:17:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-29 01:17:20,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2020-07-29 01:17:20,169 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,171 INFO L225 Difference]: With dead ends: 20 [2020-07-29 01:17:20,171 INFO L226 Difference]: Without dead ends: 20 [2020-07-29 01:17:20,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-29 01:17:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 01:17:20,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-29 01:17:20,176 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 01:17:20,176 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 01:17:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,179 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-29 01:17:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-29 01:17:20,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,180 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 01:17:20,180 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 01:17:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,182 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-29 01:17:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-29 01:17:20,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:17:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2020-07-29 01:17:20,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 10 [2020-07-29 01:17:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,187 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2020-07-29 01:17:20,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-29 01:17:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:17:20,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:17:20,189 INFO L427 AbstractCegarLoop]: === Iteration 3 === [freePointerErr2ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash -591380251, now seen corresponding path program 1 times [2020-07-29 01:17:20,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515435314] [2020-07-29 01:17:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,304 INFO L280 TraceCheckUtils]: 0: Hoare triple {239#(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; {231#true} is VALID [2020-07-29 01:17:20,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-29 01:17:20,304 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #22#return; {231#true} is VALID [2020-07-29 01:17:20,310 INFO L263 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {239#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:20,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#(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; {231#true} is VALID [2020-07-29 01:17:20,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-29 01:17:20,312 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #22#return; {231#true} is VALID [2020-07-29 01:17:20,312 INFO L263 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret3 := main(); {231#true} is VALID [2020-07-29 01:17:20,315 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; {236#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:20,316 INFO L263 TraceCheckUtils]: 6: Hoare triple {236#(= 1 (select |#valid| main_~p~0.base))} call freePointer(~p~0.base, ~p~0.offset); {237#(= 1 (select |#valid| |freePointer_#in~p.base|))} is VALID [2020-07-29 01:17:20,317 INFO L280 TraceCheckUtils]: 7: Hoare triple {237#(= 1 (select |#valid| |freePointer_#in~p.base|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset; {238#(= 1 (select |#valid| freePointer_~p.base))} is VALID [2020-07-29 01:17:20,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {238#(= 1 (select |#valid| freePointer_~p.base))} assume 0 == ~p.offset; {238#(= 1 (select |#valid| freePointer_~p.base))} is VALID [2020-07-29 01:17:20,319 INFO L280 TraceCheckUtils]: 9: Hoare triple {238#(= 1 (select |#valid| freePointer_~p.base))} assume ~p.base < #StackHeapBarrier; {238#(= 1 (select |#valid| freePointer_~p.base))} is VALID [2020-07-29 01:17:20,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(= 1 (select |#valid| freePointer_~p.base))} assume !(0 == ~p.base || 1 == #valid[~p.base]); {232#false} is VALID [2020-07-29 01:17:20,321 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,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515435314] [2020-07-29 01:17:20,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:20,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:17:20,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715913014] [2020-07-29 01:17:20,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:17:20,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:20,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:20,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:20,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:20,341 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand 6 states. [2020-07-29 01:17:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,562 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-29 01:17:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:17:20,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:17:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-29 01:17:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-29 01:17:20,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2020-07-29 01:17:20,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,602 INFO L225 Difference]: With dead ends: 19 [2020-07-29 01:17:20,602 INFO L226 Difference]: Without dead ends: 19 [2020-07-29 01:17:20,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-29 01:17:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 01:17:20,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,608 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,609 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,616 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-29 01:17:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-29 01:17:20,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,618 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,618 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:17:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,622 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-29 01:17:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-29 01:17:20,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:17:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2020-07-29 01:17:20,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 11 [2020-07-29 01:17:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,632 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2020-07-29 01:17:20,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-29 01:17:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:17:20,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:17:20,635 INFO L427 AbstractCegarLoop]: === Iteration 4 === [freePointerErr2ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 146827991, now seen corresponding path program 1 times [2020-07-29 01:17:20,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370448360] [2020-07-29 01:17:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:20,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:20,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:20,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:17:20,713 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:17:20,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:17:20,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:17:20 BoogieIcfgContainer [2020-07-29 01:17:20,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:17:20,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:17:20,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:17:20,741 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:17:20,741 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:18" (3/4) ... [2020-07-29 01:17:20,744 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:17:20,788 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:17:20,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:17:20,792 INFO L168 Benchmark]: Toolchain (without parser) took 2720.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.5 MB in the beginning and 885.5 MB in the end (delta: 64.0 MB). Peak memory consumption was 163.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:20,792 INFO L168 Benchmark]: CDTParser took 0.36 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:20,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.02 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 938.7 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:20,794 INFO L168 Benchmark]: Boogie Preprocessor took 85.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:20,795 INFO L168 Benchmark]: RCFGBuilder took 395.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:20,796 INFO L168 Benchmark]: TraceAbstraction took 1928.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 885.5 MB in the end (delta: 178.5 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:20,796 INFO L168 Benchmark]: Witness Printer took 48.35 ms. Allocated memory is still 1.1 GB. Free memory is still 885.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:20,800 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.36 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 255.02 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 938.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 395.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1928.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 885.5 MB in the end (delta: 178.5 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. * Witness Printer took 48.35 ms. Allocated memory is still 1.1 GB. Free memory is still 885.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={-1:0}, p={-1:0}] [L12] CALL freePointer(p) VAL [p={-1:0}] [L6] free(p) VAL [p={-1:0}, p={-1:0}] [L6] free(p) VAL [p={-1:0}, p={-1:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={-1:0}, p={-1:0}] [L14] p[0] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 SDtfs, 47 SDslu, 75 SDs, 0 SdLazy, 114 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 proved your program to be incorrect! Received shutdown request...