./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memset.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/ldv-memsafety/memset.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 566f1414dafe692faf7ed7456be2d3e7d288640b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:06:57,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:06:57,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:06:57,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:06:57,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:06:57,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:06:57,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:06:57,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:06:57,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:06:57,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:06:57,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:06:57,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:06:57,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:06:57,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:06:57,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:06:57,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:06:57,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:06:57,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:06:57,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:06:57,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:06:57,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:06:57,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:06:57,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:06:57,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:06:57,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:06:57,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:06:57,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:06:57,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:06:57,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:06:57,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:06:57,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:06:57,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:06:57,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:06:57,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:06:57,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:06:57,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:06:57,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:06:57,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:06:57,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:06:57,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:06:57,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:06:57,579 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:06:57,603 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:06:57,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:06:57,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:06:57,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:06:57,607 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:06:57,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:06:57,608 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:06:57,608 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:06:57,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:06:57,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:06:57,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:06:57,610 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:06:57,610 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:06:57,611 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:06:57,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:06:57,611 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:06:57,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:06:57,612 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:06:57,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:06:57,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:06:57,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:06:57,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:06:57,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:06:57,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:06:57,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:06:57,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:06:57,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:06:57,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:06:57,616 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 -> 566f1414dafe692faf7ed7456be2d3e7d288640b [2020-07-29 01:06:57,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:06:57,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:06:57,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:06:57,944 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:06:57,945 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:06:57,946 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memset.c [2020-07-29 01:06:58,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd87aa62c/51abe3a23efb429bbf16fe8b51bd1ef2/FLAG91a0c0058 [2020-07-29 01:06:58,396 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:06:58,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memset.c [2020-07-29 01:06:58,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd87aa62c/51abe3a23efb429bbf16fe8b51bd1ef2/FLAG91a0c0058 [2020-07-29 01:06:58,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd87aa62c/51abe3a23efb429bbf16fe8b51bd1ef2 [2020-07-29 01:06:58,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:06:58,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:06:58,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:06:58,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:06:58,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:06:58,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:06:58" (1/1) ... [2020-07-29 01:06:58,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84d41c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:58, skipping insertion in model container [2020-07-29 01:06:58,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:06:58" (1/1) ... [2020-07-29 01:06:58,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:06:58,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:06:58,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:06:59,001 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:06:59,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:06:59,036 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:06:59,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59 WrapperNode [2020-07-29 01:06:59,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:06:59,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:06:59,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:06:59,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:06:59,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (1/1) ... [2020-07-29 01:06:59,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:06:59,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:06:59,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:06:59,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:06:59,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (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:06:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:06:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:06:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:06:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-07-29 01:06:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-07-29 01:06:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:06:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:06:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-07-29 01:06:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:06:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:06:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:06:59,352 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:06:59,510 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:06:59,510 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-29 01:06:59,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:59 BoogieIcfgContainer [2020-07-29 01:06:59,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:06:59,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:06:59,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:06:59,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:06:59,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:06:58" (1/3) ... [2020-07-29 01:06:59,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfdf7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:06:59, skipping insertion in model container [2020-07-29 01:06:59,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:06:59" (2/3) ... [2020-07-29 01:06:59,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfdf7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:06:59, skipping insertion in model container [2020-07-29 01:06:59,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:59" (3/3) ... [2020-07-29 01:06:59,540 INFO L109 eAbstractionObserver]: Analyzing ICFG memset.c [2020-07-29 01:06:59,553 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:06:59,563 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-29 01:06:59,582 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-29 01:06:59,606 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:06:59,606 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:06:59,606 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:06:59,607 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:06:59,607 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:06:59,607 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:06:59,607 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:06:59,608 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:06:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-29 01:06:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:06:59,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:59,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:59,638 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1092847368, now seen corresponding path program 1 times [2020-07-29 01:06:59,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:06:59,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189189683] [2020-07-29 01:06:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:06:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:59,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:06:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:59,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#(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; {23#true} is VALID [2020-07-29 01:06:59,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-29 01:06:59,885 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #22#return; {23#true} is VALID [2020-07-29 01:06:59,892 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:06:59,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#(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; {23#true} is VALID [2020-07-29 01:06:59,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-29 01:06:59,893 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #22#return; {23#true} is VALID [2020-07-29 01:06:59,893 INFO L263 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2020-07-29 01:06:59,896 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {28#(= 1 (select |#valid| |main_~#cstats~0.base|))} is VALID [2020-07-29 01:06:59,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#(= 1 (select |#valid| |main_~#cstats~0.base|))} assume !(1 == #valid[~#cstats~0.base]); {24#false} is VALID [2020-07-29 01:06:59,899 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:06:59,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189189683] [2020-07-29 01:06:59,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:59,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:06:59,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858363151] [2020-07-29 01:06:59,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:06:59,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:59,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:06:59,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:59,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:06:59,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:06:59,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:06:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:06:59,961 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2020-07-29 01:07:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,190 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-29 01:07:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:07:00,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:07:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:07:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:07:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:07:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:07:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:07:00,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2020-07-29 01:07:00,266 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:07:00,277 INFO L225 Difference]: With dead ends: 19 [2020-07-29 01:07:00,278 INFO L226 Difference]: Without dead ends: 16 [2020-07-29 01:07:00,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:07:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-29 01:07:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:07:00,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:07:00,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:00,319 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:00,319 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,323 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-29 01:07:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-29 01:07:00,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:00,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:00,324 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:00,324 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,328 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-29 01:07:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-29 01:07:00,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:00,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:00,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:07:00,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:07:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:07:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-29 01:07:00,334 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2020-07-29 01:07:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:07:00,335 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-29 01:07:00,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:07:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-29 01:07:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:07:00,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:07:00,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:07:00,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:07:00,337 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:07:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:07:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1092847367, now seen corresponding path program 1 times [2020-07-29 01:07:00,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:07:00,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798524355] [2020-07-29 01:07:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:07:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:00,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:07:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:00,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {105#(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; {99#true} is VALID [2020-07-29 01:07:00,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-29 01:07:00,425 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {99#true} {99#true} #22#return; {99#true} is VALID [2020-07-29 01:07:00,427 INFO L263 TraceCheckUtils]: 0: Hoare triple {99#true} call ULTIMATE.init(); {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:07:00,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {105#(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; {99#true} is VALID [2020-07-29 01:07:00,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {99#true} assume true; {99#true} is VALID [2020-07-29 01:07:00,428 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {99#true} {99#true} #22#return; {99#true} is VALID [2020-07-29 01:07:00,429 INFO L263 TraceCheckUtils]: 4: Hoare triple {99#true} call #t~ret4 := main(); {99#true} is VALID [2020-07-29 01:07:00,431 INFO L280 TraceCheckUtils]: 5: Hoare triple {99#true} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {104#(and (= 0 |main_~#cstats~0.offset|) (= 80 (select |#length| |main_~#cstats~0.base|)))} is VALID [2020-07-29 01:07:00,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {104#(and (= 0 |main_~#cstats~0.offset|) (= 80 (select |#length| |main_~#cstats~0.base|)))} assume !(80 + ~#cstats~0.offset <= #length[~#cstats~0.base] && 0 <= ~#cstats~0.offset); {100#false} is VALID [2020-07-29 01:07:00,434 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:07:00,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798524355] [2020-07-29 01:07:00,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:07:00,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:07:00,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569268631] [2020-07-29 01:07:00,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:07:00,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:07:00,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:07:00,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:00,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:07:00,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:07:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:07:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:07:00,453 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2020-07-29 01:07:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,550 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-29 01:07:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:07:00,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:07:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:07:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:07:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:07:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:07:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:07:00,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2020-07-29 01:07:00,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:00,589 INFO L225 Difference]: With dead ends: 15 [2020-07-29 01:07:00,589 INFO L226 Difference]: Without dead ends: 15 [2020-07-29 01:07:00,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:07:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-29 01:07:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 01:07:00,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:07:00,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-29 01:07:00,594 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-29 01:07:00,595 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-29 01:07:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,597 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-29 01:07:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-29 01:07:00,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:00,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:00,598 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-29 01:07:00,599 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-29 01:07:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,601 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-29 01:07:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-29 01:07:00,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:00,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:00,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:07:00,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:07:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:07:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-29 01:07:00,605 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2020-07-29 01:07:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:07:00,605 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-29 01:07:00,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:07:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-29 01:07:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:07:00,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:07:00,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:07:00,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:07:00,608 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:07:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:07:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1462327129, now seen corresponding path program 1 times [2020-07-29 01:07:00,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:07:00,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954294862] [2020-07-29 01:07:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:07:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:00,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:07:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:00,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {178#(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; {168#true} is VALID [2020-07-29 01:07:00,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-29 01:07:00,669 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #22#return; {168#true} is VALID [2020-07-29 01:07:00,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:07:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:00,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {168#true} is VALID [2020-07-29 01:07:00,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} #t~loopctr5 := 0; {179#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:00,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {179#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume !(#t~loopctr5 < #amount); {180#(<= |#Ultimate.C_memset_#amount| 0)} is VALID [2020-07-29 01:07:00,725 INFO L280 TraceCheckUtils]: 3: Hoare triple {180#(<= |#Ultimate.C_memset_#amount| 0)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {180#(<= |#Ultimate.C_memset_#amount| 0)} is VALID [2020-07-29 01:07:00,728 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {180#(<= |#Ultimate.C_memset_#amount| 0)} {168#true} #26#return; {169#false} is VALID [2020-07-29 01:07:00,730 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {178#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:07:00,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {178#(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; {168#true} is VALID [2020-07-29 01:07:00,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-29 01:07:00,732 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #22#return; {168#true} is VALID [2020-07-29 01:07:00,732 INFO L263 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret4 := main(); {168#true} is VALID [2020-07-29 01:07:00,734 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {168#true} is VALID [2020-07-29 01:07:00,735 INFO L263 TraceCheckUtils]: 6: Hoare triple {168#true} call #t~memset~res3.base, #t~memset~res3.offset := #Ultimate.C_memset(~#cstats~0.base, ~#cstats~0.offset, 0, 80); {168#true} is VALID [2020-07-29 01:07:00,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {168#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {168#true} is VALID [2020-07-29 01:07:00,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {168#true} #t~loopctr5 := 0; {179#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:00,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {179#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume !(#t~loopctr5 < #amount); {180#(<= |#Ultimate.C_memset_#amount| 0)} is VALID [2020-07-29 01:07:00,740 INFO L280 TraceCheckUtils]: 10: Hoare triple {180#(<= |#Ultimate.C_memset_#amount| 0)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {180#(<= |#Ultimate.C_memset_#amount| 0)} is VALID [2020-07-29 01:07:00,742 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {180#(<= |#Ultimate.C_memset_#amount| 0)} {168#true} #26#return; {169#false} is VALID [2020-07-29 01:07:00,743 INFO L280 TraceCheckUtils]: 12: Hoare triple {169#false} havoc #t~memset~res3.base, #t~memset~res3.offset;#res := 0;call ULTIMATE.dealloc(~#cstats~0.base, ~#cstats~0.offset);havoc ~#cstats~0.base, ~#cstats~0.offset; {169#false} is VALID [2020-07-29 01:07:00,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {169#false} assume !(#valid == old(#valid)); {169#false} is VALID [2020-07-29 01:07:00,745 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:07:00,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954294862] [2020-07-29 01:07:00,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:07:00,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:07:00,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396394848] [2020-07-29 01:07:00,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-29 01:07:00,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:07:00,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:07:00,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:00,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:07:00,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:07:00,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:07:00,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:07:00,776 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2020-07-29 01:07:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:00,951 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-29 01:07:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:07:00,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-29 01:07:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:07:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:07:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:07:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:07:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:07:00,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-29 01:07:00,991 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:07:00,992 INFO L225 Difference]: With dead ends: 18 [2020-07-29 01:07:00,992 INFO L226 Difference]: Without dead ends: 16 [2020-07-29 01:07:00,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:07:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-29 01:07:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:07:00,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:07:01,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:01,002 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:01,003 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:01,006 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-29 01:07:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-29 01:07:01,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:01,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:01,007 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:01,007 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 01:07:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:01,015 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-29 01:07:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-29 01:07:01,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:01,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:01,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:07:01,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:07:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:07:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-29 01:07:01,020 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2020-07-29 01:07:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:07:01,021 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-29 01:07:01,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:07:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-29 01:07:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:07:01,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:07:01,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:07:01,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:07:01,026 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:07:01,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:07:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1971150090, now seen corresponding path program 1 times [2020-07-29 01:07:01,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:07:01,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675449411] [2020-07-29 01:07:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:07:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:01,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:07:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:01,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {264#(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; {253#true} is VALID [2020-07-29 01:07:01,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-29 01:07:01,093 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #22#return; {253#true} is VALID [2020-07-29 01:07:01,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:07:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:01,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {253#true} is VALID [2020-07-29 01:07:01,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} #t~loopctr5 := 0; {265#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:01,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {266#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} is VALID [2020-07-29 01:07:01,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} assume !(#t~loopctr5 < #amount); {267#(<= |#Ultimate.C_memset_#amount| 1)} is VALID [2020-07-29 01:07:01,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#(<= |#Ultimate.C_memset_#amount| 1)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {267#(<= |#Ultimate.C_memset_#amount| 1)} is VALID [2020-07-29 01:07:01,155 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {267#(<= |#Ultimate.C_memset_#amount| 1)} {253#true} #26#return; {254#false} is VALID [2020-07-29 01:07:01,157 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {264#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:07:01,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#(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; {253#true} is VALID [2020-07-29 01:07:01,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-29 01:07:01,158 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {253#true} {253#true} #22#return; {253#true} is VALID [2020-07-29 01:07:01,158 INFO L263 TraceCheckUtils]: 4: Hoare triple {253#true} call #t~ret4 := main(); {253#true} is VALID [2020-07-29 01:07:01,159 INFO L280 TraceCheckUtils]: 5: Hoare triple {253#true} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {253#true} is VALID [2020-07-29 01:07:01,159 INFO L263 TraceCheckUtils]: 6: Hoare triple {253#true} call #t~memset~res3.base, #t~memset~res3.offset := #Ultimate.C_memset(~#cstats~0.base, ~#cstats~0.offset, 0, 80); {253#true} is VALID [2020-07-29 01:07:01,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {253#true} is VALID [2020-07-29 01:07:01,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {253#true} #t~loopctr5 := 0; {265#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:01,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {266#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} is VALID [2020-07-29 01:07:01,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {266#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} assume !(#t~loopctr5 < #amount); {267#(<= |#Ultimate.C_memset_#amount| 1)} is VALID [2020-07-29 01:07:01,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {267#(<= |#Ultimate.C_memset_#amount| 1)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {267#(<= |#Ultimate.C_memset_#amount| 1)} is VALID [2020-07-29 01:07:01,167 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {267#(<= |#Ultimate.C_memset_#amount| 1)} {253#true} #26#return; {254#false} is VALID [2020-07-29 01:07:01,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {254#false} havoc #t~memset~res3.base, #t~memset~res3.offset;#res := 0;call ULTIMATE.dealloc(~#cstats~0.base, ~#cstats~0.offset);havoc ~#cstats~0.base, ~#cstats~0.offset; {254#false} is VALID [2020-07-29 01:07:01,168 INFO L280 TraceCheckUtils]: 14: Hoare triple {254#false} assume !(#valid == old(#valid)); {254#false} is VALID [2020-07-29 01:07:01,169 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:07:01,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675449411] [2020-07-29 01:07:01,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282851212] [2020-07-29 01:07:01,170 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:07:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:01,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:07:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:01,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:07:01,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-29 01:07:01,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {253#true} is VALID [2020-07-29 01:07:01,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-29 01:07:01,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {253#true} {253#true} #22#return; {253#true} is VALID [2020-07-29 01:07:01,392 INFO L263 TraceCheckUtils]: 4: Hoare triple {253#true} call #t~ret4 := main(); {253#true} is VALID [2020-07-29 01:07:01,392 INFO L280 TraceCheckUtils]: 5: Hoare triple {253#true} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {253#true} is VALID [2020-07-29 01:07:01,392 INFO L263 TraceCheckUtils]: 6: Hoare triple {253#true} call #t~memset~res3.base, #t~memset~res3.offset := #Ultimate.C_memset(~#cstats~0.base, ~#cstats~0.offset, 0, 80); {253#true} is VALID [2020-07-29 01:07:01,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {253#true} is VALID [2020-07-29 01:07:01,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {253#true} #t~loopctr5 := 0; {265#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:01,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {266#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} is VALID [2020-07-29 01:07:01,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {266#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} assume !(#t~loopctr5 < #amount); {267#(<= |#Ultimate.C_memset_#amount| 1)} is VALID [2020-07-29 01:07:01,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {267#(<= |#Ultimate.C_memset_#amount| 1)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {267#(<= |#Ultimate.C_memset_#amount| 1)} is VALID [2020-07-29 01:07:01,401 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {267#(<= |#Ultimate.C_memset_#amount| 1)} {253#true} #26#return; {254#false} is VALID [2020-07-29 01:07:01,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {254#false} havoc #t~memset~res3.base, #t~memset~res3.offset;#res := 0;call ULTIMATE.dealloc(~#cstats~0.base, ~#cstats~0.offset);havoc ~#cstats~0.base, ~#cstats~0.offset; {254#false} is VALID [2020-07-29 01:07:01,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {254#false} assume !(#valid == old(#valid)); {254#false} is VALID [2020-07-29 01:07:01,403 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:07:01,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:07:01,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2020-07-29 01:07:01,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618886735] [2020-07-29 01:07:01,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:07:01,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:07:01,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:07:01,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:01,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:07:01,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:07:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:07:01,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:07:01,435 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2020-07-29 01:07:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:01,647 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-29 01:07:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:07:01,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:07:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:07:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:07:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-29 01:07:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:07:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-29 01:07:01,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2020-07-29 01:07:01,686 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:07:01,687 INFO L225 Difference]: With dead ends: 19 [2020-07-29 01:07:01,687 INFO L226 Difference]: Without dead ends: 17 [2020-07-29 01:07:01,689 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:07:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-29 01:07:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 01:07:01,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:07:01,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-29 01:07:01,692 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-29 01:07:01,693 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-29 01:07:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:01,696 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-29 01:07:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-29 01:07:01,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:01,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:01,697 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-29 01:07:01,697 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-29 01:07:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:01,700 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-29 01:07:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-29 01:07:01,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:01,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:01,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:07:01,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:07:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:07:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-29 01:07:01,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2020-07-29 01:07:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:07:01,705 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-29 01:07:01,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:07:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-29 01:07:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:07:01,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:07:01,709 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:07:01,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:07:01,924 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:07:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:07:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1034761479, now seen corresponding path program 2 times [2020-07-29 01:07:01,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:07:01,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690810864] [2020-07-29 01:07:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:07:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:02,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:07:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:02,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {400#(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; {388#true} is VALID [2020-07-29 01:07:02,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-29 01:07:02,030 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #22#return; {388#true} is VALID [2020-07-29 01:07:02,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-29 01:07:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:02,115 INFO L280 TraceCheckUtils]: 0: Hoare triple {388#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {388#true} is VALID [2020-07-29 01:07:02,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#true} #t~loopctr5 := 0; {401#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:02,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {401#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {402#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} is VALID [2020-07-29 01:07:02,119 INFO L280 TraceCheckUtils]: 3: Hoare triple {402#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {403#(<= |#Ultimate.C_memset_#t~loopctr5| 2)} is VALID [2020-07-29 01:07:02,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#(<= |#Ultimate.C_memset_#t~loopctr5| 2)} assume !(#t~loopctr5 < #amount); {404#(<= |#Ultimate.C_memset_#amount| 2)} is VALID [2020-07-29 01:07:02,121 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#(<= |#Ultimate.C_memset_#amount| 2)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {404#(<= |#Ultimate.C_memset_#amount| 2)} is VALID [2020-07-29 01:07:02,129 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {404#(<= |#Ultimate.C_memset_#amount| 2)} {388#true} #26#return; {389#false} is VALID [2020-07-29 01:07:02,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:07:02,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {400#(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; {388#true} is VALID [2020-07-29 01:07:02,131 INFO L280 TraceCheckUtils]: 2: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-29 01:07:02,132 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} #22#return; {388#true} is VALID [2020-07-29 01:07:02,132 INFO L263 TraceCheckUtils]: 4: Hoare triple {388#true} call #t~ret4 := main(); {388#true} is VALID [2020-07-29 01:07:02,132 INFO L280 TraceCheckUtils]: 5: Hoare triple {388#true} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {388#true} is VALID [2020-07-29 01:07:02,133 INFO L263 TraceCheckUtils]: 6: Hoare triple {388#true} call #t~memset~res3.base, #t~memset~res3.offset := #Ultimate.C_memset(~#cstats~0.base, ~#cstats~0.offset, 0, 80); {388#true} is VALID [2020-07-29 01:07:02,133 INFO L280 TraceCheckUtils]: 7: Hoare triple {388#true} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {388#true} is VALID [2020-07-29 01:07:02,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {388#true} #t~loopctr5 := 0; {401#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} is VALID [2020-07-29 01:07:02,136 INFO L280 TraceCheckUtils]: 9: Hoare triple {401#(<= |#Ultimate.C_memset_#t~loopctr5| 0)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {402#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} is VALID [2020-07-29 01:07:02,138 INFO L280 TraceCheckUtils]: 10: Hoare triple {402#(<= |#Ultimate.C_memset_#t~loopctr5| 1)} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {403#(<= |#Ultimate.C_memset_#t~loopctr5| 2)} is VALID [2020-07-29 01:07:02,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {403#(<= |#Ultimate.C_memset_#t~loopctr5| 2)} assume !(#t~loopctr5 < #amount); {404#(<= |#Ultimate.C_memset_#amount| 2)} is VALID [2020-07-29 01:07:02,145 INFO L280 TraceCheckUtils]: 12: Hoare triple {404#(<= |#Ultimate.C_memset_#amount| 2)} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {404#(<= |#Ultimate.C_memset_#amount| 2)} is VALID [2020-07-29 01:07:02,147 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {404#(<= |#Ultimate.C_memset_#amount| 2)} {388#true} #26#return; {389#false} is VALID [2020-07-29 01:07:02,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {389#false} havoc #t~memset~res3.base, #t~memset~res3.offset;#res := 0;call ULTIMATE.dealloc(~#cstats~0.base, ~#cstats~0.offset);havoc ~#cstats~0.base, ~#cstats~0.offset; {389#false} is VALID [2020-07-29 01:07:02,148 INFO L280 TraceCheckUtils]: 15: Hoare triple {389#false} assume !(#valid == old(#valid)); {389#false} is VALID [2020-07-29 01:07:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:07:02,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690810864] [2020-07-29 01:07:02,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905584644] [2020-07-29 01:07:02,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:07:02,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:07:02,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:07:02,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:07:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:07:02,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:07:02,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2020-07-29 01:07:02,284 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:07:02,289 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:07:02,290 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:07:02,291 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2020-07-29 01:07:04,837 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:07:04,837 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_BEFORE_CALL_1|, |v_main_~#cstats~0.base_BEFORE_CALL_1|]. (and (= 0 (select |v_old(#valid)_BEFORE_CALL_1| |v_main_~#cstats~0.base_BEFORE_CALL_1|)) (= |#valid| (store |v_old(#valid)_BEFORE_CALL_1| |v_main_~#cstats~0.base_BEFORE_CALL_1| 1))) [2020-07-29 01:07:04,838 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#cstats~0.base_BEFORE_CALL_1|]. (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1) [2020-07-29 01:07:05,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {388#true} is VALID [2020-07-29 01:07:05,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {388#true} is VALID [2020-07-29 01:07:05,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {388#true} assume true; {388#true} is VALID [2020-07-29 01:07:05,154 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} #22#return; {388#true} is VALID [2020-07-29 01:07:05,155 INFO L263 TraceCheckUtils]: 4: Hoare triple {388#true} call #t~ret4 := main(); {420#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:07:05,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#(= |#valid| |old(#valid)|)} call ~#cstats~0.base, ~#cstats~0.offset := #Ultimate.allocOnStack(80); {424#(and (= 0 (select |old(#valid)| |main_~#cstats~0.base|)) (= |#valid| (store |old(#valid)| |main_~#cstats~0.base| 1)))} is VALID [2020-07-29 01:07:05,159 INFO L263 TraceCheckUtils]: 6: Hoare triple {424#(and (= 0 (select |old(#valid)| |main_~#cstats~0.base|)) (= |#valid| (store |old(#valid)| |main_~#cstats~0.base| 1)))} call #t~memset~res3.base, #t~memset~res3.offset := #Ultimate.C_memset(~#cstats~0.base, ~#cstats~0.offset, 0, 80); {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,160 INFO L280 TraceCheckUtils]: 7: Hoare triple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,160 INFO L280 TraceCheckUtils]: 8: Hoare triple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} #t~loopctr5 := 0; {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} assume #t~loopctr5 < #amount;#t~loopctr5 := 1 + #t~loopctr5; {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,163 INFO L280 TraceCheckUtils]: 11: Hoare triple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} assume !(#t~loopctr5 < #amount); {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,164 INFO L280 TraceCheckUtils]: 12: Hoare triple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} is VALID [2020-07-29 01:07:05,166 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {428#(exists ((|v_main_~#cstats~0.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_main_~#cstats~0.base_BEFORE_CALL_1|) 1))} {424#(and (= 0 (select |old(#valid)| |main_~#cstats~0.base|)) (= |#valid| (store |old(#valid)| |main_~#cstats~0.base| 1)))} #26#return; {424#(and (= 0 (select |old(#valid)| |main_~#cstats~0.base|)) (= |#valid| (store |old(#valid)| |main_~#cstats~0.base| 1)))} is VALID [2020-07-29 01:07:05,167 INFO L280 TraceCheckUtils]: 14: Hoare triple {424#(and (= 0 (select |old(#valid)| |main_~#cstats~0.base|)) (= |#valid| (store |old(#valid)| |main_~#cstats~0.base| 1)))} havoc #t~memset~res3.base, #t~memset~res3.offset;#res := 0;call ULTIMATE.dealloc(~#cstats~0.base, ~#cstats~0.offset);havoc ~#cstats~0.base, ~#cstats~0.offset; {453#(exists ((|v_main_~#cstats~0.base_8| Int)) (and (= 0 (select |old(#valid)| |v_main_~#cstats~0.base_8|)) (= (store |old(#valid)| |v_main_~#cstats~0.base_8| 0) |#valid|)))} is VALID [2020-07-29 01:07:05,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {453#(exists ((|v_main_~#cstats~0.base_8| Int)) (and (= 0 (select |old(#valid)| |v_main_~#cstats~0.base_8|)) (= (store |old(#valid)| |v_main_~#cstats~0.base_8| 0) |#valid|)))} assume !(#valid == old(#valid)); {389#false} is VALID [2020-07-29 01:07:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:07:05,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:07:05,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2020-07-29 01:07:05,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660493531] [2020-07-29 01:07:05,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:07:05,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:07:05,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:07:05,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:05,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:07:05,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:07:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:07:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:07:05,197 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2020-07-29 01:07:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:05,372 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-29 01:07:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:07:05,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:07:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:07:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:07:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-29 01:07:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:07:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-29 01:07:05,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2020-07-29 01:07:05,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:07:05,408 INFO L225 Difference]: With dead ends: 16 [2020-07-29 01:07:05,408 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:07:05,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:07:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:07:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:07:05,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:07:05,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:05,409 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:05,410 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:05,410 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:07:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:07:05,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:05,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:05,411 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:05,411 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:07:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:07:05,411 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:07:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:07:05,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:05,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:07:05,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:07:05,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:07:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:07:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:07:05,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-07-29 01:07:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:07:05,413 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:07:05,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:07:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:07:05,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:07:05,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:07:05,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:07:05 BoogieIcfgContainer [2020-07-29 01:07:05,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:07:05,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:07:05,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:07:05,629 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:07:05,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:06:59" (3/4) ... [2020-07-29 01:07:05,633 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:07:05,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:07:05,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2020-07-29 01:07:05,654 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:07:05,659 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-07-29 01:07:05,660 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-29 01:07:05,660 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:07:05,660 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:07:05,697 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:07:05,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:07:05,700 INFO L168 Benchmark]: Toolchain (without parser) took 6935.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -209.7 MB). Peak memory consumption was 301.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:05,701 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:07:05,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.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:07:05,703 INFO L168 Benchmark]: Boogie Preprocessor took 99.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:05,704 INFO L168 Benchmark]: RCFGBuilder took 375.56 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:05,704 INFO L168 Benchmark]: TraceAbstraction took 6101.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 777.6 MB in the end (delta: 294.9 MB). Peak memory consumption was 294.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:05,705 INFO L168 Benchmark]: Witness Printer took 68.93 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 777.6 MB in the beginning and 1.2 GB in the end (delta: -392.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:07:05,709 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.38 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.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 99.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.56 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6101.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 777.6 MB in the end (delta: 294.9 MB). Peak memory consumption was 294.9 MB. Max. memory is 11.5 GB. * Witness Printer took 68.93 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 777.6 MB in the beginning and 1.2 GB in the end (delta: -392.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.0s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 53 SDtfs, 34 SDslu, 65 SDs, 0 SdLazy, 123 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 83 ConstructedInterpolants, 8 QuantifiedInterpolants, 3158 SizeOfPredicates, 1 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3/8 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 correct! Received shutdown request...