./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/realloc1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/realloc1.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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:17:23,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:23,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:23,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:23,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:23,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:23,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:23,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:23,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:23,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:23,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:23,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:23,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:23,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:23,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:23,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:23,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:23,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:23,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:23,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:23,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:23,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:23,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:23,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:23,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:23,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:23,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:23,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:23,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:23,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:23,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:23,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:23,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:23,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:23,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:23,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:23,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:23,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:23,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:23,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:23,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:23,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:17:23,693 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:23,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:23,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:23,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:23,696 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:23,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:23,696 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:17:23,697 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:23,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:23,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:17:23,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:23,698 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:23,698 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:23,698 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:23,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:23,699 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:23,699 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:17:23,699 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:23,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:23,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:23,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:23,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:23,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:23,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:23,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:23,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:23,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:23,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:23,703 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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2020-07-29 01:17:24,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:24,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:24,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:24,045 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:24,047 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:24,048 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/realloc1.c [2020-07-29 01:17:24,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e346df6/8574ae312408415eb8e319c09ed0216a/FLAG70a1a13a2 [2020-07-29 01:17:24,610 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:24,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c [2020-07-29 01:17:24,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e346df6/8574ae312408415eb8e319c09ed0216a/FLAG70a1a13a2 [2020-07-29 01:17:24,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e346df6/8574ae312408415eb8e319c09ed0216a [2020-07-29 01:17:24,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:24,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:25,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:25,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:25,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:25,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:24" (1/1) ... [2020-07-29 01:17:25,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9b5758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25, skipping insertion in model container [2020-07-29 01:17:25,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:24" (1/1) ... [2020-07-29 01:17:25,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:25,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:25,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:25,222 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:25,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:25,259 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:25,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25 WrapperNode [2020-07-29 01:17:25,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:25,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:25,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:25,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:25,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... [2020-07-29 01:17:25,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:25,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:25,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:25,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:25,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:25,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:25,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:25,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:25,435 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2020-07-29 01:17:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:17:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:25,871 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:25,872 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:17:25,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:25 BoogieIcfgContainer [2020-07-29 01:17:25,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:25,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:25,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:25,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:25,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:17:24" (1/3) ... [2020-07-29 01:17:25,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@877d243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:25, skipping insertion in model container [2020-07-29 01:17:25,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:25" (2/3) ... [2020-07-29 01:17:25,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@877d243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:25, skipping insertion in model container [2020-07-29 01:17:25,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:25" (3/3) ... [2020-07-29 01:17:25,886 INFO L109 eAbstractionObserver]: Analyzing ICFG realloc1.c [2020-07-29 01:17:25,897 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:25,905 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-29 01:17:25,918 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-29 01:17:25,934 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:25,935 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:25,935 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:25,935 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:25,935 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:25,935 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:25,935 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:25,936 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-29 01:17:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:25,958 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:25,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:25,959 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 604141221, now seen corresponding path program 1 times [2020-07-29 01:17:25,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:25,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579337544] [2020-07-29 01:17:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {42#(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; {36#true} is VALID [2020-07-29 01:17:26,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-29 01:17:26,192 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #49#return; {36#true} is VALID [2020-07-29 01:17:26,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:26,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(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; {36#true} is VALID [2020-07-29 01:17:26,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-29 01:17:26,197 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #49#return; {36#true} is VALID [2020-07-29 01:17:26,197 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2020-07-29 01:17:26,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {41#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:26,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#(= 0 main_~i~0)} assume !(~i~0 < 10); {37#false} is VALID [2020-07-29 01:17:26,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {37#false} assume !(0 == ~p~0.offset); {37#false} is VALID [2020-07-29 01:17:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:26,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579337544] [2020-07-29 01:17:26,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:26,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:17:26,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544810972] [2020-07-29 01:17:26,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:26,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:26,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:26,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:26,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:26,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:26,256 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-07-29 01:17:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,495 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-29 01:17:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:26,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2020-07-29 01:17:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2020-07-29 01:17:26,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2020-07-29 01:17:26,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:26,596 INFO L225 Difference]: With dead ends: 39 [2020-07-29 01:17:26,596 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:17:26,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:17:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:17:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-07-29 01:17:26,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:26,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 31 states. [2020-07-29 01:17:26,634 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 31 states. [2020-07-29 01:17:26,634 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 31 states. [2020-07-29 01:17:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,639 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-29 01:17:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-29 01:17:26,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:26,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:26,641 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 36 states. [2020-07-29 01:17:26,641 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 36 states. [2020-07-29 01:17:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,646 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-29 01:17:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-29 01:17:26,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:26,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:26,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:26,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:17:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-29 01:17:26,653 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 8 [2020-07-29 01:17:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:26,653 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-29 01:17:26,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-29 01:17:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:26,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:26,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:26,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:17:26,655 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash 604141275, now seen corresponding path program 1 times [2020-07-29 01:17:26,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:26,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861467650] [2020-07-29 01:17:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#(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; {187#true} is VALID [2020-07-29 01:17:26,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {187#true} assume true; {187#true} is VALID [2020-07-29 01:17:26,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {187#true} {187#true} #49#return; {187#true} is VALID [2020-07-29 01:17:26,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {193#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:26,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#(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; {187#true} is VALID [2020-07-29 01:17:26,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {187#true} assume true; {187#true} is VALID [2020-07-29 01:17:26,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} #49#return; {187#true} is VALID [2020-07-29 01:17:26,768 INFO L263 TraceCheckUtils]: 4: Hoare triple {187#true} call #t~ret7 := main(); {187#true} is VALID [2020-07-29 01:17:26,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {187#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {192#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:26,771 INFO L280 TraceCheckUtils]: 6: Hoare triple {192#(= 1 (select |#valid| main_~p~0.base))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {192#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:26,772 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {188#false} is VALID [2020-07-29 01:17:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:26,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861467650] [2020-07-29 01:17:26,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:26,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:26,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458036228] [2020-07-29 01:17:26,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:26,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:26,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:26,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:26,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:26,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:26,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:26,792 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-07-29 01:17:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,970 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:26,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 01:17:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-29 01:17:26,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-29 01:17:27,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:27,027 INFO L225 Difference]: With dead ends: 32 [2020-07-29 01:17:27,027 INFO L226 Difference]: Without dead ends: 32 [2020-07-29 01:17:27,028 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:17:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-29 01:17:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-07-29 01:17:27,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:27,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 29 states. [2020-07-29 01:17:27,032 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 29 states. [2020-07-29 01:17:27,032 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 29 states. [2020-07-29 01:17:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,035 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:27,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:27,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:27,037 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 32 states. [2020-07-29 01:17:27,037 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 32 states. [2020-07-29 01:17:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,040 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:27,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:27,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:27,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:27,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:17:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-29 01:17:27,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2020-07-29 01:17:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:27,044 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-29 01:17:27,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:17:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:27,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:27,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:27,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:17:27,046 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 604141276, now seen corresponding path program 1 times [2020-07-29 01:17:27,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:27,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249455049] [2020-07-29 01:17:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {327#(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; {321#true} is VALID [2020-07-29 01:17:27,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {321#true} assume true; {321#true} is VALID [2020-07-29 01:17:27,139 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {321#true} {321#true} #49#return; {321#true} is VALID [2020-07-29 01:17:27,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {321#true} call ULTIMATE.init(); {327#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:27,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#(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; {321#true} is VALID [2020-07-29 01:17:27,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {321#true} assume true; {321#true} is VALID [2020-07-29 01:17:27,141 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {321#true} {321#true} #49#return; {321#true} is VALID [2020-07-29 01:17:27,142 INFO L263 TraceCheckUtils]: 4: Hoare triple {321#true} call #t~ret7 := main(); {321#true} is VALID [2020-07-29 01:17:27,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {321#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {326#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:27,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {326#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:27,148 INFO L280 TraceCheckUtils]: 7: Hoare triple {326#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !(1 + (~p~0.offset + ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + ~i~0); {322#false} is VALID [2020-07-29 01:17:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:27,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249455049] [2020-07-29 01:17:27,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:27,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:27,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934808325] [2020-07-29 01:17:27,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:27,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:27,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:27,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:27,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:27,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:27,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:27,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:27,168 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2020-07-29 01:17:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,356 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-29 01:17:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:27,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-29 01:17:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-29 01:17:27,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2020-07-29 01:17:27,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:27,435 INFO L225 Difference]: With dead ends: 32 [2020-07-29 01:17:27,435 INFO L226 Difference]: Without dead ends: 32 [2020-07-29 01:17:27,436 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:17:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-29 01:17:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-29 01:17:27,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:27,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-29 01:17:27,444 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-29 01:17:27,444 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-29 01:17:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,449 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-29 01:17:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-29 01:17:27,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:27,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:27,455 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-29 01:17:27,456 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-29 01:17:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,464 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-29 01:17:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-29 01:17:27,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:27,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:27,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:27,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:17:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-29 01:17:27,470 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2020-07-29 01:17:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:27,475 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-29 01:17:27,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:17:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:27,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:27,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:27,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:17:27,477 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash -572402136, now seen corresponding path program 1 times [2020-07-29 01:17:27,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:27,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403091282] [2020-07-29 01:17:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(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; {456#true} is VALID [2020-07-29 01:17:27,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {456#true} assume true; {456#true} is VALID [2020-07-29 01:17:27,598 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {456#true} {456#true} #49#return; {456#true} is VALID [2020-07-29 01:17:27,599 INFO L263 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:27,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(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; {456#true} is VALID [2020-07-29 01:17:27,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2020-07-29 01:17:27,600 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #49#return; {456#true} is VALID [2020-07-29 01:17:27,601 INFO L263 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret7 := main(); {456#true} is VALID [2020-07-29 01:17:27,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {456#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {461#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {461#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {461#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {461#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {461#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,605 INFO L280 TraceCheckUtils]: 8: Hoare triple {461#(= 0 main_~i~0)} havoc #t~nondet4; {461#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {461#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {462#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {462#(<= main_~i~0 1)} assume !(~i~0 < 10); {457#false} is VALID [2020-07-29 01:17:27,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {457#false} assume !(0 == ~p~0.offset); {457#false} is VALID [2020-07-29 01:17:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:27,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403091282] [2020-07-29 01:17:27,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891844412] [2020-07-29 01:17:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:17:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:27,831 INFO L263 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2020-07-29 01:17:27,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {456#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {456#true} is VALID [2020-07-29 01:17:27,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {456#true} assume true; {456#true} is VALID [2020-07-29 01:17:27,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} #49#return; {456#true} is VALID [2020-07-29 01:17:27,833 INFO L263 TraceCheckUtils]: 4: Hoare triple {456#true} call #t~ret7 := main(); {456#true} is VALID [2020-07-29 01:17:27,838 INFO L280 TraceCheckUtils]: 5: Hoare triple {456#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {482#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {482#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {482#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {482#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {482#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#(<= main_~i~0 0)} havoc #t~nondet4; {482#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {482#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {462#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {462#(<= main_~i~0 1)} assume !(~i~0 < 10); {457#false} is VALID [2020-07-29 01:17:27,843 INFO L280 TraceCheckUtils]: 11: Hoare triple {457#false} assume !(0 == ~p~0.offset); {457#false} is VALID [2020-07-29 01:17:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:27,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:27,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-29 01:17:27,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566711851] [2020-07-29 01:17:27,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 01:17:27,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:27,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:27,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:27,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:27,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:27,883 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2020-07-29 01:17:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,082 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:28,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 01:17:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-29 01:17:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-29 01:17:28,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-29 01:17:28,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:28,154 INFO L225 Difference]: With dead ends: 37 [2020-07-29 01:17:28,155 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:17:28,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:17:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2020-07-29 01:17:28,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:28,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2020-07-29 01:17:28,166 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2020-07-29 01:17:28,166 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2020-07-29 01:17:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,170 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:28,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:28,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:28,171 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2020-07-29 01:17:28,171 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2020-07-29 01:17:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,177 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:28,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:28,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:28,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:28,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:17:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-29 01:17:28,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2020-07-29 01:17:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:28,182 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-29 01:17:28,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-29 01:17:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:28,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:28,183 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:28,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:28,397 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -572402081, now seen corresponding path program 1 times [2020-07-29 01:17:28,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:28,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533679884] [2020-07-29 01:17:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {651#(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; {644#true} is VALID [2020-07-29 01:17:28,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {644#true} assume true; {644#true} is VALID [2020-07-29 01:17:28,514 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {644#true} {644#true} #49#return; {644#true} is VALID [2020-07-29 01:17:28,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {651#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:28,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#(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; {644#true} is VALID [2020-07-29 01:17:28,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2020-07-29 01:17:28,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #49#return; {644#true} is VALID [2020-07-29 01:17:28,517 INFO L263 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret7 := main(); {644#true} is VALID [2020-07-29 01:17:28,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {644#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet4; {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:28,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:28,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(1 + (~p~0.offset + ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + ~i~0); {645#false} is VALID [2020-07-29 01:17:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:28,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533679884] [2020-07-29 01:17:28,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805067797] [2020-07-29 01:17:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:17:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:17:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:28,627 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:17:28,628 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:28,643 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:28,644 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:28,644 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:28,648 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:28,648 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_15|]. (and (= 0 main_~p~0.offset) (= 0 main_~i~0) (= |#length| (store |v_#length_15| main_~p~0.base 40))) [2020-07-29 01:17:28,649 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 0 main_~i~0) (= 40 (select |#length| main_~p~0.base))) [2020-07-29 01:17:28,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2020-07-29 01:17:28,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {644#true} is VALID [2020-07-29 01:17:28,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2020-07-29 01:17:28,683 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #49#return; {644#true} is VALID [2020-07-29 01:17:28,683 INFO L263 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret7 := main(); {644#true} is VALID [2020-07-29 01:17:28,685 INFO L280 TraceCheckUtils]: 5: Hoare triple {644#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,687 INFO L280 TraceCheckUtils]: 7: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet4; {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:28,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {649#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:28,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:28,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {650#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(1 + (~p~0.offset + ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + ~i~0); {645#false} is VALID [2020-07-29 01:17:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:28,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:28,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:17:28,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355770141] [2020-07-29 01:17:28,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:28,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:28,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:17:28,714 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:17:28,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:17:28,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:17:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:28,715 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2020-07-29 01:17:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,992 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-29 01:17:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:28,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-29 01:17:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-29 01:17:28,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2020-07-29 01:17:29,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:29,051 INFO L225 Difference]: With dead ends: 36 [2020-07-29 01:17:29,052 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:17:29,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:17:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-07-29 01:17:29,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:29,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2020-07-29 01:17:29,057 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2020-07-29 01:17:29,057 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2020-07-29 01:17:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,059 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-29 01:17:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-29 01:17:29,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,060 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2020-07-29 01:17:29,060 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2020-07-29 01:17:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,062 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-29 01:17:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-29 01:17:29,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:29,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:17:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-29 01:17:29,065 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 12 [2020-07-29 01:17:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:29,066 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-29 01:17:29,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:17:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-29 01:17:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:17:29,066 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:29,066 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:29,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:29,276 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash -768623573, now seen corresponding path program 2 times [2020-07-29 01:17:29,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:29,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094929212] [2020-07-29 01:17:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {835#(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; {829#true} is VALID [2020-07-29 01:17:29,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-29 01:17:29,351 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #49#return; {829#true} is VALID [2020-07-29 01:17:29,352 INFO L263 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {835#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:29,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {835#(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; {829#true} is VALID [2020-07-29 01:17:29,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-29 01:17:29,353 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #49#return; {829#true} is VALID [2020-07-29 01:17:29,353 INFO L263 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret7 := main(); {829#true} is VALID [2020-07-29 01:17:29,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {834#(= 0 main_~p~0.offset)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {834#(= 0 main_~p~0.offset)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {834#(= 0 main_~p~0.offset)} havoc #t~nondet4; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {834#(= 0 main_~p~0.offset)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {834#(= 0 main_~p~0.offset)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,359 INFO L280 TraceCheckUtils]: 11: Hoare triple {834#(= 0 main_~p~0.offset)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {834#(= 0 main_~p~0.offset)} havoc #t~nondet4; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,366 INFO L280 TraceCheckUtils]: 13: Hoare triple {834#(= 0 main_~p~0.offset)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,367 INFO L280 TraceCheckUtils]: 14: Hoare triple {834#(= 0 main_~p~0.offset)} assume !(~i~0 < 10); {834#(= 0 main_~p~0.offset)} is VALID [2020-07-29 01:17:29,367 INFO L280 TraceCheckUtils]: 15: Hoare triple {834#(= 0 main_~p~0.offset)} assume !(0 == ~p~0.offset); {830#false} is VALID [2020-07-29 01:17:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-29 01:17:29,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094929212] [2020-07-29 01:17:29,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:29,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:29,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976925176] [2020-07-29 01:17:29,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-29 01:17:29,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:29,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:29,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:29,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:29,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:29,388 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 4 states. [2020-07-29 01:17:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,517 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:29,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-29 01:17:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 01:17:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 01:17:29,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2020-07-29 01:17:29,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:29,572 INFO L225 Difference]: With dead ends: 36 [2020-07-29 01:17:29,572 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:17:29,572 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:17:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:17:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-29 01:17:29,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:29,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-29 01:17:29,578 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-29 01:17:29,578 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-29 01:17:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,582 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:29,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,583 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-29 01:17:29,584 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-29 01:17:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,588 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:29,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:29,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:17:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-29 01:17:29,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 16 [2020-07-29 01:17:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:29,593 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-29 01:17:29,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-29 01:17:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:17:29,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:29,595 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:29,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:17:29,596 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash -768623518, now seen corresponding path program 2 times [2020-07-29 01:17:29,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:29,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98081915] [2020-07-29 01:17:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {988#(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; {979#true} is VALID [2020-07-29 01:17:29,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2020-07-29 01:17:29,754 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #49#return; {979#true} is VALID [2020-07-29 01:17:29,755 INFO L263 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {988#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:29,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {988#(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; {979#true} is VALID [2020-07-29 01:17:29,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2020-07-29 01:17:29,756 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #49#return; {979#true} is VALID [2020-07-29 01:17:29,756 INFO L263 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret7 := main(); {979#true} is VALID [2020-07-29 01:17:29,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {979#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:29,758 INFO L280 TraceCheckUtils]: 6: Hoare triple {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:29,759 INFO L280 TraceCheckUtils]: 7: Hoare triple {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:29,760 INFO L280 TraceCheckUtils]: 8: Hoare triple {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet4; {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:29,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {984#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,762 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} havoc #t~nondet4; {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,764 INFO L280 TraceCheckUtils]: 13: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:29,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {986#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {987#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} is VALID [2020-07-29 01:17:29,766 INFO L280 TraceCheckUtils]: 15: Hoare triple {987#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} assume !(1 + (~p~0.offset + ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + ~i~0); {980#false} is VALID [2020-07-29 01:17:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:29,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98081915] [2020-07-29 01:17:29,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683232518] [2020-07-29 01:17:29,768 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:29,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:29,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:29,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:17:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:29,832 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:17:29,833 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:29,839 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:29,839 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:29,840 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:29,842 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:29,842 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_16|]. (and (<= 0 main_~i~0) (= |#length| (store |v_#length_16| main_~p~0.base 40)) (= 0 main_~p~0.offset)) [2020-07-29 01:17:29,842 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base))) [2020-07-29 01:17:29,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {979#true} is VALID [2020-07-29 01:17:29,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {979#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {979#true} is VALID [2020-07-29 01:17:29,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2020-07-29 01:17:29,954 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #49#return; {979#true} is VALID [2020-07-29 01:17:29,954 INFO L263 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret7 := main(); {979#true} is VALID [2020-07-29 01:17:29,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {979#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:29,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:29,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:29,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} havoc #t~nondet4; {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:29,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {1007#(and (<= 0 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} havoc #t~nondet4; {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:29,965 INFO L280 TraceCheckUtils]: 13: Hoare triple {985#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:29,966 INFO L280 TraceCheckUtils]: 14: Hoare triple {986#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {987#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} is VALID [2020-07-29 01:17:29,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {987#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} assume !(1 + (~p~0.offset + ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + ~i~0); {980#false} is VALID [2020-07-29 01:17:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:29,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:17:29,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-07-29 01:17:29,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681655460] [2020-07-29 01:17:29,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:17:29,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:29,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:29,991 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:17:29,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:29,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:29,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:29,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:29,993 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 6 states. [2020-07-29 01:17:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,170 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:17:30,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:17:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-29 01:17:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-29 01:17:30,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-29 01:17:30,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:30,229 INFO L225 Difference]: With dead ends: 36 [2020-07-29 01:17:30,229 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:17:30,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:17:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-07-29 01:17:30,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:30,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2020-07-29 01:17:30,233 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2020-07-29 01:17:30,233 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2020-07-29 01:17:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,235 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:30,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,236 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2020-07-29 01:17:30,236 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2020-07-29 01:17:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,238 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:30,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:30,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:17:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-29 01:17:30,241 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 16 [2020-07-29 01:17:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:30,241 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-29 01:17:30,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:17:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:17:30,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:30,242 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:30,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:30,456 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1942473074, now seen corresponding path program 1 times [2020-07-29 01:17:30,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:30,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507624138] [2020-07-29 01:17:30,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {1183#(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; {1175#true} is VALID [2020-07-29 01:17:30,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {1175#true} assume true; {1175#true} is VALID [2020-07-29 01:17:30,539 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1175#true} {1175#true} #49#return; {1175#true} is VALID [2020-07-29 01:17:30,540 INFO L263 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:30,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {1183#(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; {1175#true} is VALID [2020-07-29 01:17:30,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2020-07-29 01:17:30,540 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #49#return; {1175#true} is VALID [2020-07-29 01:17:30,541 INFO L263 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret7 := main(); {1175#true} is VALID [2020-07-29 01:17:30,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {1175#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1180#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,545 INFO L280 TraceCheckUtils]: 6: Hoare triple {1180#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1180#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {1180#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1180#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {1180#(= 0 main_~i~0)} havoc #t~nondet4; {1180#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {1180#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {1181#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {1181#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {1181#(<= main_~i~0 1)} havoc #t~nondet4; {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {1181#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1182#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {1182#(<= main_~i~0 2)} assume !(~i~0 < 10); {1176#false} is VALID [2020-07-29 01:17:30,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {1176#false} assume 0 == ~p~0.offset; {1176#false} is VALID [2020-07-29 01:17:30,549 INFO L280 TraceCheckUtils]: 16: Hoare triple {1176#false} assume !(~p~0.base < #StackHeapBarrier); {1176#false} is VALID [2020-07-29 01:17:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:30,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507624138] [2020-07-29 01:17:30,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424623461] [2020-07-29 01:17:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:17:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:30,695 INFO L263 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2020-07-29 01:17:30,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1175#true} is VALID [2020-07-29 01:17:30,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2020-07-29 01:17:30,696 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #49#return; {1175#true} is VALID [2020-07-29 01:17:30,696 INFO L263 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret7 := main(); {1175#true} is VALID [2020-07-29 01:17:30,697 INFO L280 TraceCheckUtils]: 5: Hoare triple {1175#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1202#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {1202#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1202#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {1202#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1202#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {1202#(<= main_~i~0 0)} havoc #t~nondet4; {1202#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {1202#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {1181#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {1181#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,703 INFO L280 TraceCheckUtils]: 12: Hoare triple {1181#(<= main_~i~0 1)} havoc #t~nondet4; {1181#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,704 INFO L280 TraceCheckUtils]: 13: Hoare triple {1181#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1182#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {1182#(<= main_~i~0 2)} assume !(~i~0 < 10); {1176#false} is VALID [2020-07-29 01:17:30,705 INFO L280 TraceCheckUtils]: 15: Hoare triple {1176#false} assume 0 == ~p~0.offset; {1176#false} is VALID [2020-07-29 01:17:30,705 INFO L280 TraceCheckUtils]: 16: Hoare triple {1176#false} assume !(~p~0.base < #StackHeapBarrier); {1176#false} is VALID [2020-07-29 01:17:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:30,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:30,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-29 01:17:30,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225979325] [2020-07-29 01:17:30,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-29 01:17:30,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:30,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:17:30,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:30,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:17:30,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:17:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:17:30,740 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2020-07-29 01:17:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,910 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:17:30,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-29 01:17:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:17:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-29 01:17:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:17:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-29 01:17:30,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-29 01:17:30,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:30,968 INFO L225 Difference]: With dead ends: 37 [2020-07-29 01:17:30,968 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:17:30,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:17:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:17:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-29 01:17:30,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:30,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-29 01:17:30,971 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-29 01:17:30,971 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-29 01:17:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,973 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:30,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,974 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-29 01:17:30,974 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-29 01:17:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,976 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:30,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:30,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:17:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-29 01:17:30,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 17 [2020-07-29 01:17:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:30,978 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-29 01:17:30,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:17:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-29 01:17:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:17:30,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:30,979 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:31,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:31,189 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1487393457, now seen corresponding path program 2 times [2020-07-29 01:17:31,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:31,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146224908] [2020-07-29 01:17:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {1389#(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; {1380#true} is VALID [2020-07-29 01:17:31,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-29 01:17:31,293 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #49#return; {1380#true} is VALID [2020-07-29 01:17:31,294 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:31,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {1389#(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; {1380#true} is VALID [2020-07-29 01:17:31,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-29 01:17:31,295 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1380#true} {1380#true} #49#return; {1380#true} is VALID [2020-07-29 01:17:31,295 INFO L263 TraceCheckUtils]: 4: Hoare triple {1380#true} call #t~ret7 := main(); {1380#true} is VALID [2020-07-29 01:17:31,296 INFO L280 TraceCheckUtils]: 5: Hoare triple {1380#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1385#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {1385#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1385#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {1385#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1385#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,298 INFO L280 TraceCheckUtils]: 8: Hoare triple {1385#(= 0 main_~i~0)} havoc #t~nondet4; {1385#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {1385#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1386#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,299 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1386#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1386#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#(<= main_~i~0 1)} havoc #t~nondet4; {1386#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,303 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1387#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,304 INFO L280 TraceCheckUtils]: 14: Hoare triple {1387#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1387#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,305 INFO L280 TraceCheckUtils]: 15: Hoare triple {1387#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1387#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,306 INFO L280 TraceCheckUtils]: 16: Hoare triple {1387#(<= main_~i~0 2)} havoc #t~nondet4; {1387#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,307 INFO L280 TraceCheckUtils]: 17: Hoare triple {1387#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1388#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:31,307 INFO L280 TraceCheckUtils]: 18: Hoare triple {1388#(<= main_~i~0 3)} assume !(~i~0 < 10); {1381#false} is VALID [2020-07-29 01:17:31,308 INFO L280 TraceCheckUtils]: 19: Hoare triple {1381#false} assume 0 == ~p~0.offset; {1381#false} is VALID [2020-07-29 01:17:31,308 INFO L280 TraceCheckUtils]: 20: Hoare triple {1381#false} assume !(~p~0.base < #StackHeapBarrier); {1381#false} is VALID [2020-07-29 01:17:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:31,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146224908] [2020-07-29 01:17:31,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671900203] [2020-07-29 01:17:31,312 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:31,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:17:31,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:31,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:17:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:31,420 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-29 01:17:31,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1380#true} is VALID [2020-07-29 01:17:31,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-29 01:17:31,421 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1380#true} {1380#true} #49#return; {1380#true} is VALID [2020-07-29 01:17:31,422 INFO L263 TraceCheckUtils]: 4: Hoare triple {1380#true} call #t~ret7 := main(); {1380#true} is VALID [2020-07-29 01:17:31,423 INFO L280 TraceCheckUtils]: 5: Hoare triple {1380#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} havoc #t~nondet4; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,427 INFO L280 TraceCheckUtils]: 10: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,428 INFO L280 TraceCheckUtils]: 11: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} havoc #t~nondet4; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,428 INFO L280 TraceCheckUtils]: 13: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,429 INFO L280 TraceCheckUtils]: 14: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,429 INFO L280 TraceCheckUtils]: 15: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,430 INFO L280 TraceCheckUtils]: 16: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} havoc #t~nondet4; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(~i~0 < 10); {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,432 INFO L280 TraceCheckUtils]: 19: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume 0 == ~p~0.offset; {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:31,432 INFO L280 TraceCheckUtils]: 20: Hoare triple {1408#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(~p~0.base < #StackHeapBarrier); {1381#false} is VALID [2020-07-29 01:17:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-29 01:17:31,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:17:31,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2020-07-29 01:17:31,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806060348] [2020-07-29 01:17:31,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-29 01:17:31,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:31,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:17:31,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:31,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:17:31,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:31,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:17:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:31,460 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 3 states. [2020-07-29 01:17:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:31,513 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:17:31,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-29 01:17:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:17:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-29 01:17:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:17:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-29 01:17:31,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-29 01:17:31,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:31,552 INFO L225 Difference]: With dead ends: 36 [2020-07-29 01:17:31,552 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:17:31,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:17:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-29 01:17:31,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:31,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-29 01:17:31,557 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-29 01:17:31,557 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-29 01:17:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:31,566 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:31,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:31,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:31,567 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-29 01:17:31,568 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-29 01:17:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:31,571 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-29 01:17:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:31,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:31,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:31,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:31,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 01:17:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-29 01:17:31,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 21 [2020-07-29 01:17:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:31,575 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-29 01:17:31,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:17:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-29 01:17:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:17:31,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:31,576 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:31,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:31,787 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 838999410, now seen corresponding path program 1 times [2020-07-29 01:17:31,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:31,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608819252] [2020-07-29 01:17:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {1603#(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; {1594#true} is VALID [2020-07-29 01:17:31,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {1594#true} assume true; {1594#true} is VALID [2020-07-29 01:17:31,879 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1594#true} {1594#true} #49#return; {1594#true} is VALID [2020-07-29 01:17:31,880 INFO L263 TraceCheckUtils]: 0: Hoare triple {1594#true} call ULTIMATE.init(); {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:31,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {1603#(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; {1594#true} is VALID [2020-07-29 01:17:31,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {1594#true} assume true; {1594#true} is VALID [2020-07-29 01:17:31,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1594#true} {1594#true} #49#return; {1594#true} is VALID [2020-07-29 01:17:31,880 INFO L263 TraceCheckUtils]: 4: Hoare triple {1594#true} call #t~ret7 := main(); {1594#true} is VALID [2020-07-29 01:17:31,881 INFO L280 TraceCheckUtils]: 5: Hoare triple {1594#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1599#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,882 INFO L280 TraceCheckUtils]: 6: Hoare triple {1599#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1599#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {1599#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1599#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {1599#(= 0 main_~i~0)} havoc #t~nondet4; {1599#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:31,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {1599#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,893 INFO L280 TraceCheckUtils]: 10: Hoare triple {1600#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,893 INFO L280 TraceCheckUtils]: 11: Hoare triple {1600#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {1600#(<= main_~i~0 1)} havoc #t~nondet4; {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:31,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {1600#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,895 INFO L280 TraceCheckUtils]: 14: Hoare triple {1601#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,896 INFO L280 TraceCheckUtils]: 15: Hoare triple {1601#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,896 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#(<= main_~i~0 2)} havoc #t~nondet4; {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:31,898 INFO L280 TraceCheckUtils]: 17: Hoare triple {1601#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1602#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:31,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {1602#(<= main_~i~0 3)} assume !(~i~0 < 10); {1595#false} is VALID [2020-07-29 01:17:31,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {1595#false} assume 0 == ~p~0.offset; {1595#false} is VALID [2020-07-29 01:17:31,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {1595#false} assume ~p~0.base < #StackHeapBarrier; {1595#false} is VALID [2020-07-29 01:17:31,900 INFO L280 TraceCheckUtils]: 21: Hoare triple {1595#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {1595#false} is VALID [2020-07-29 01:17:31,900 INFO L280 TraceCheckUtils]: 22: Hoare triple {1595#false} assume !(1 == #valid[~p~0.base]); {1595#false} is VALID [2020-07-29 01:17:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:31,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608819252] [2020-07-29 01:17:31,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330190016] [2020-07-29 01:17:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:17:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:31,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:32,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {1594#true} call ULTIMATE.init(); {1594#true} is VALID [2020-07-29 01:17:32,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {1594#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1594#true} is VALID [2020-07-29 01:17:32,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {1594#true} assume true; {1594#true} is VALID [2020-07-29 01:17:32,099 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1594#true} {1594#true} #49#return; {1594#true} is VALID [2020-07-29 01:17:32,101 INFO L263 TraceCheckUtils]: 4: Hoare triple {1594#true} call #t~ret7 := main(); {1594#true} is VALID [2020-07-29 01:17:32,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {1594#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1622#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:32,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {1622#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1622#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:32,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {1622#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1622#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:32,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {1622#(<= main_~i~0 0)} havoc #t~nondet4; {1622#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:32,113 INFO L280 TraceCheckUtils]: 9: Hoare triple {1622#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,114 INFO L280 TraceCheckUtils]: 10: Hoare triple {1600#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,114 INFO L280 TraceCheckUtils]: 11: Hoare triple {1600#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,115 INFO L280 TraceCheckUtils]: 12: Hoare triple {1600#(<= main_~i~0 1)} havoc #t~nondet4; {1600#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {1600#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,116 INFO L280 TraceCheckUtils]: 14: Hoare triple {1601#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {1601#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,118 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#(<= main_~i~0 2)} havoc #t~nondet4; {1601#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,118 INFO L280 TraceCheckUtils]: 17: Hoare triple {1601#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1602#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:32,119 INFO L280 TraceCheckUtils]: 18: Hoare triple {1602#(<= main_~i~0 3)} assume !(~i~0 < 10); {1595#false} is VALID [2020-07-29 01:17:32,119 INFO L280 TraceCheckUtils]: 19: Hoare triple {1595#false} assume 0 == ~p~0.offset; {1595#false} is VALID [2020-07-29 01:17:32,120 INFO L280 TraceCheckUtils]: 20: Hoare triple {1595#false} assume ~p~0.base < #StackHeapBarrier; {1595#false} is VALID [2020-07-29 01:17:32,120 INFO L280 TraceCheckUtils]: 21: Hoare triple {1595#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {1595#false} is VALID [2020-07-29 01:17:32,120 INFO L280 TraceCheckUtils]: 22: Hoare triple {1595#false} assume !(1 == #valid[~p~0.base]); {1595#false} is VALID [2020-07-29 01:17:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:32,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:32,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-29 01:17:32,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975085986] [2020-07-29 01:17:32,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:17:32,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:32,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:17:32,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:32,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:17:32,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:17:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:32,161 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2020-07-29 01:17:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:32,348 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-29 01:17:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:17:32,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:17:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:17:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-29 01:17:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:17:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-29 01:17:32,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-29 01:17:32,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:32,403 INFO L225 Difference]: With dead ends: 40 [2020-07-29 01:17:32,403 INFO L226 Difference]: Without dead ends: 40 [2020-07-29 01:17:32,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-29 01:17:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-29 01:17:32,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:32,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-29 01:17:32,407 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-29 01:17:32,407 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-29 01:17:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:32,408 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-29 01:17:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-29 01:17:32,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:32,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:32,409 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-29 01:17:32,409 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-29 01:17:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:32,413 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-29 01:17:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-29 01:17:32,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:32,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:32,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:32,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 01:17:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-29 01:17:32,416 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 23 [2020-07-29 01:17:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:32,416 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-29 01:17:32,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:17:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-29 01:17:32,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:32,417 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:32,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:32,628 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 758998927, now seen corresponding path program 2 times [2020-07-29 01:17:32,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:32,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262714225] [2020-07-29 01:17:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {1840#(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; {1830#true} is VALID [2020-07-29 01:17:32,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-29 01:17:32,793 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1830#true} {1830#true} #49#return; {1830#true} is VALID [2020-07-29 01:17:32,794 INFO L263 TraceCheckUtils]: 0: Hoare triple {1830#true} call ULTIMATE.init(); {1840#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:32,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {1840#(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; {1830#true} is VALID [2020-07-29 01:17:32,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-29 01:17:32,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1830#true} #49#return; {1830#true} is VALID [2020-07-29 01:17:32,795 INFO L263 TraceCheckUtils]: 4: Hoare triple {1830#true} call #t~ret7 := main(); {1830#true} is VALID [2020-07-29 01:17:32,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1835#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:32,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {1835#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1835#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:32,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {1835#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1835#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:32,797 INFO L280 TraceCheckUtils]: 8: Hoare triple {1835#(= 0 main_~i~0)} havoc #t~nondet4; {1835#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:32,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {1835#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,798 INFO L280 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,800 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#(<= main_~i~0 1)} havoc #t~nondet4; {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:32,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {1836#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {1837#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,818 INFO L280 TraceCheckUtils]: 15: Hoare triple {1837#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,819 INFO L280 TraceCheckUtils]: 16: Hoare triple {1837#(<= main_~i~0 2)} havoc #t~nondet4; {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:32,820 INFO L280 TraceCheckUtils]: 17: Hoare triple {1837#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:32,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {1838#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:32,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {1838#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:32,821 INFO L280 TraceCheckUtils]: 20: Hoare triple {1838#(<= main_~i~0 3)} havoc #t~nondet4; {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:32,822 INFO L280 TraceCheckUtils]: 21: Hoare triple {1838#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1839#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:32,823 INFO L280 TraceCheckUtils]: 22: Hoare triple {1839#(<= main_~i~0 4)} assume !(~i~0 < 10); {1831#false} is VALID [2020-07-29 01:17:32,823 INFO L280 TraceCheckUtils]: 23: Hoare triple {1831#false} assume 0 == ~p~0.offset; {1831#false} is VALID [2020-07-29 01:17:32,823 INFO L280 TraceCheckUtils]: 24: Hoare triple {1831#false} assume ~p~0.base < #StackHeapBarrier; {1831#false} is VALID [2020-07-29 01:17:32,823 INFO L280 TraceCheckUtils]: 25: Hoare triple {1831#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {1831#false} is VALID [2020-07-29 01:17:32,823 INFO L280 TraceCheckUtils]: 26: Hoare triple {1831#false} assume !(1 == #valid[~p~0.base]); {1831#false} is VALID [2020-07-29 01:17:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:32,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262714225] [2020-07-29 01:17:32,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244937212] [2020-07-29 01:17:32,825 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:32,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:32,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:32,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:17:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:32,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:33,024 INFO L263 TraceCheckUtils]: 0: Hoare triple {1830#true} call ULTIMATE.init(); {1830#true} is VALID [2020-07-29 01:17:33,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1830#true} is VALID [2020-07-29 01:17:33,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-29 01:17:33,025 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1830#true} #49#return; {1830#true} is VALID [2020-07-29 01:17:33,025 INFO L263 TraceCheckUtils]: 4: Hoare triple {1830#true} call #t~ret7 := main(); {1830#true} is VALID [2020-07-29 01:17:33,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1859#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {1859#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1859#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,029 INFO L280 TraceCheckUtils]: 7: Hoare triple {1859#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1859#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,030 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#(<= main_~i~0 0)} havoc #t~nondet4; {1859#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,031 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#(<= main_~i~0 1)} havoc #t~nondet4; {1836#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {1836#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,036 INFO L280 TraceCheckUtils]: 14: Hoare triple {1837#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {1837#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,037 INFO L280 TraceCheckUtils]: 16: Hoare triple {1837#(<= main_~i~0 2)} havoc #t~nondet4; {1837#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {1837#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,039 INFO L280 TraceCheckUtils]: 18: Hoare triple {1838#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,039 INFO L280 TraceCheckUtils]: 19: Hoare triple {1838#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {1838#(<= main_~i~0 3)} havoc #t~nondet4; {1838#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,041 INFO L280 TraceCheckUtils]: 21: Hoare triple {1838#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1839#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,042 INFO L280 TraceCheckUtils]: 22: Hoare triple {1839#(<= main_~i~0 4)} assume !(~i~0 < 10); {1831#false} is VALID [2020-07-29 01:17:33,042 INFO L280 TraceCheckUtils]: 23: Hoare triple {1831#false} assume 0 == ~p~0.offset; {1831#false} is VALID [2020-07-29 01:17:33,042 INFO L280 TraceCheckUtils]: 24: Hoare triple {1831#false} assume ~p~0.base < #StackHeapBarrier; {1831#false} is VALID [2020-07-29 01:17:33,042 INFO L280 TraceCheckUtils]: 25: Hoare triple {1831#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {1831#false} is VALID [2020-07-29 01:17:33,042 INFO L280 TraceCheckUtils]: 26: Hoare triple {1831#false} assume !(1 == #valid[~p~0.base]); {1831#false} is VALID [2020-07-29 01:17:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:33,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:33,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-29 01:17:33,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253991615] [2020-07-29 01:17:33,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-29 01:17:33,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:33,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:17:33,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:33,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:17:33,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:17:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:33,084 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2020-07-29 01:17:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:33,316 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-29 01:17:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:33,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-29 01:17:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2020-07-29 01:17:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2020-07-29 01:17:33,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2020-07-29 01:17:33,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:33,369 INFO L225 Difference]: With dead ends: 44 [2020-07-29 01:17:33,369 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 01:17:33,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 01:17:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-29 01:17:33,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:33,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-29 01:17:33,374 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-29 01:17:33,374 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-29 01:17:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:33,376 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-29 01:17:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-29 01:17:33,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:33,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:33,377 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-29 01:17:33,377 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-29 01:17:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:33,379 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-29 01:17:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-29 01:17:33,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:33,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:33,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:33,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 01:17:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-29 01:17:33,381 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 27 [2020-07-29 01:17:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:33,382 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-29 01:17:33,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:17:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-29 01:17:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:17:33,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:33,383 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:33,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:33,595 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:33,596 INFO L82 PathProgramCache]: Analyzing trace with hash 660364076, now seen corresponding path program 3 times [2020-07-29 01:17:33,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:33,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558138112] [2020-07-29 01:17:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:33,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:33,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {2106#(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; {2095#true} is VALID [2020-07-29 01:17:33,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2020-07-29 01:17:33,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #49#return; {2095#true} is VALID [2020-07-29 01:17:33,723 INFO L263 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2106#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:33,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {2106#(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; {2095#true} is VALID [2020-07-29 01:17:33,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2020-07-29 01:17:33,724 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #49#return; {2095#true} is VALID [2020-07-29 01:17:33,724 INFO L263 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret7 := main(); {2095#true} is VALID [2020-07-29 01:17:33,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {2095#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2100#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:33,726 INFO L280 TraceCheckUtils]: 6: Hoare triple {2100#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2100#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:33,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {2100#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2100#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:33,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {2100#(= 0 main_~i~0)} havoc #t~nondet4; {2100#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:33,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {2100#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,729 INFO L280 TraceCheckUtils]: 10: Hoare triple {2101#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,730 INFO L280 TraceCheckUtils]: 11: Hoare triple {2101#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {2101#(<= main_~i~0 1)} havoc #t~nondet4; {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {2101#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {2102#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,733 INFO L280 TraceCheckUtils]: 15: Hoare triple {2102#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,734 INFO L280 TraceCheckUtils]: 16: Hoare triple {2102#(<= main_~i~0 2)} havoc #t~nondet4; {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,735 INFO L280 TraceCheckUtils]: 17: Hoare triple {2102#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,735 INFO L280 TraceCheckUtils]: 18: Hoare triple {2103#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,736 INFO L280 TraceCheckUtils]: 19: Hoare triple {2103#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,736 INFO L280 TraceCheckUtils]: 20: Hoare triple {2103#(<= main_~i~0 3)} havoc #t~nondet4; {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,737 INFO L280 TraceCheckUtils]: 21: Hoare triple {2103#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,738 INFO L280 TraceCheckUtils]: 22: Hoare triple {2104#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,739 INFO L280 TraceCheckUtils]: 23: Hoare triple {2104#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,739 INFO L280 TraceCheckUtils]: 24: Hoare triple {2104#(<= main_~i~0 4)} havoc #t~nondet4; {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,740 INFO L280 TraceCheckUtils]: 25: Hoare triple {2104#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2105#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:33,741 INFO L280 TraceCheckUtils]: 26: Hoare triple {2105#(<= main_~i~0 5)} assume !(~i~0 < 10); {2096#false} is VALID [2020-07-29 01:17:33,741 INFO L280 TraceCheckUtils]: 27: Hoare triple {2096#false} assume 0 == ~p~0.offset; {2096#false} is VALID [2020-07-29 01:17:33,742 INFO L280 TraceCheckUtils]: 28: Hoare triple {2096#false} assume ~p~0.base < #StackHeapBarrier; {2096#false} is VALID [2020-07-29 01:17:33,742 INFO L280 TraceCheckUtils]: 29: Hoare triple {2096#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {2096#false} is VALID [2020-07-29 01:17:33,742 INFO L280 TraceCheckUtils]: 30: Hoare triple {2096#false} assume !(1 == #valid[~p~0.base]); {2096#false} is VALID [2020-07-29 01:17:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:33,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558138112] [2020-07-29 01:17:33,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845156073] [2020-07-29 01:17:33,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:33,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-07-29 01:17:33,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:33,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:17:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:33,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:33,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2020-07-29 01:17:33,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {2095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2095#true} is VALID [2020-07-29 01:17:33,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2020-07-29 01:17:33,966 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #49#return; {2095#true} is VALID [2020-07-29 01:17:33,966 INFO L263 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret7 := main(); {2095#true} is VALID [2020-07-29 01:17:33,968 INFO L280 TraceCheckUtils]: 5: Hoare triple {2095#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2125#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,968 INFO L280 TraceCheckUtils]: 6: Hoare triple {2125#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2125#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,969 INFO L280 TraceCheckUtils]: 7: Hoare triple {2125#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2125#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {2125#(<= main_~i~0 0)} havoc #t~nondet4; {2125#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:33,970 INFO L280 TraceCheckUtils]: 9: Hoare triple {2125#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,970 INFO L280 TraceCheckUtils]: 10: Hoare triple {2101#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,971 INFO L280 TraceCheckUtils]: 11: Hoare triple {2101#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,971 INFO L280 TraceCheckUtils]: 12: Hoare triple {2101#(<= main_~i~0 1)} havoc #t~nondet4; {2101#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:33,972 INFO L280 TraceCheckUtils]: 13: Hoare triple {2101#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,972 INFO L280 TraceCheckUtils]: 14: Hoare triple {2102#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,972 INFO L280 TraceCheckUtils]: 15: Hoare triple {2102#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,974 INFO L280 TraceCheckUtils]: 16: Hoare triple {2102#(<= main_~i~0 2)} havoc #t~nondet4; {2102#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:33,975 INFO L280 TraceCheckUtils]: 17: Hoare triple {2102#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,977 INFO L280 TraceCheckUtils]: 18: Hoare triple {2103#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {2103#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {2103#(<= main_~i~0 3)} havoc #t~nondet4; {2103#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:33,980 INFO L280 TraceCheckUtils]: 21: Hoare triple {2103#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,981 INFO L280 TraceCheckUtils]: 22: Hoare triple {2104#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,981 INFO L280 TraceCheckUtils]: 23: Hoare triple {2104#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,982 INFO L280 TraceCheckUtils]: 24: Hoare triple {2104#(<= main_~i~0 4)} havoc #t~nondet4; {2104#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:33,986 INFO L280 TraceCheckUtils]: 25: Hoare triple {2104#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2105#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:33,986 INFO L280 TraceCheckUtils]: 26: Hoare triple {2105#(<= main_~i~0 5)} assume !(~i~0 < 10); {2096#false} is VALID [2020-07-29 01:17:33,986 INFO L280 TraceCheckUtils]: 27: Hoare triple {2096#false} assume 0 == ~p~0.offset; {2096#false} is VALID [2020-07-29 01:17:33,987 INFO L280 TraceCheckUtils]: 28: Hoare triple {2096#false} assume ~p~0.base < #StackHeapBarrier; {2096#false} is VALID [2020-07-29 01:17:33,987 INFO L280 TraceCheckUtils]: 29: Hoare triple {2096#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {2096#false} is VALID [2020-07-29 01:17:33,987 INFO L280 TraceCheckUtils]: 30: Hoare triple {2096#false} assume !(1 == #valid[~p~0.base]); {2096#false} is VALID [2020-07-29 01:17:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:33,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:33,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-29 01:17:33,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924544703] [2020-07-29 01:17:33,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-29 01:17:33,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:33,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:17:34,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:34,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:17:34,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:17:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:34,025 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2020-07-29 01:17:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:34,291 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-29 01:17:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:17:34,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-29 01:17:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-29 01:17:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-29 01:17:34,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-29 01:17:34,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:34,348 INFO L225 Difference]: With dead ends: 48 [2020-07-29 01:17:34,348 INFO L226 Difference]: Without dead ends: 48 [2020-07-29 01:17:34,349 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-29 01:17:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2020-07-29 01:17:34,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:34,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 45 states. [2020-07-29 01:17:34,357 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 45 states. [2020-07-29 01:17:34,357 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 45 states. [2020-07-29 01:17:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:34,360 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-29 01:17:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-29 01:17:34,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:34,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:34,361 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 48 states. [2020-07-29 01:17:34,361 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 48 states. [2020-07-29 01:17:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:34,362 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2020-07-29 01:17:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-29 01:17:34,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:34,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:34,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:34,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:17:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2020-07-29 01:17:34,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 31 [2020-07-29 01:17:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:34,366 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-07-29 01:17:34,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:17:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-29 01:17:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-29 01:17:34,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:34,370 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:34,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-29 01:17:34,571 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1265514569, now seen corresponding path program 4 times [2020-07-29 01:17:34,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:34,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354661594] [2020-07-29 01:17:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:34,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:34,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {2401#(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; {2389#true} is VALID [2020-07-29 01:17:34,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {2389#true} assume true; {2389#true} is VALID [2020-07-29 01:17:34,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2389#true} {2389#true} #49#return; {2389#true} is VALID [2020-07-29 01:17:34,690 INFO L263 TraceCheckUtils]: 0: Hoare triple {2389#true} call ULTIMATE.init(); {2401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:34,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {2401#(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; {2389#true} is VALID [2020-07-29 01:17:34,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {2389#true} assume true; {2389#true} is VALID [2020-07-29 01:17:34,690 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2389#true} {2389#true} #49#return; {2389#true} is VALID [2020-07-29 01:17:34,690 INFO L263 TraceCheckUtils]: 4: Hoare triple {2389#true} call #t~ret7 := main(); {2389#true} is VALID [2020-07-29 01:17:34,692 INFO L280 TraceCheckUtils]: 5: Hoare triple {2389#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2394#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:34,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {2394#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2394#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:34,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {2394#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2394#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:34,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {2394#(= 0 main_~i~0)} havoc #t~nondet4; {2394#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:34,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {2394#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {2395#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {2395#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {2395#(<= main_~i~0 1)} havoc #t~nondet4; {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {2395#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {2396#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {2396#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,698 INFO L280 TraceCheckUtils]: 16: Hoare triple {2396#(<= main_~i~0 2)} havoc #t~nondet4; {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,699 INFO L280 TraceCheckUtils]: 17: Hoare triple {2396#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {2397#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,700 INFO L280 TraceCheckUtils]: 19: Hoare triple {2397#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,700 INFO L280 TraceCheckUtils]: 20: Hoare triple {2397#(<= main_~i~0 3)} havoc #t~nondet4; {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,701 INFO L280 TraceCheckUtils]: 21: Hoare triple {2397#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,702 INFO L280 TraceCheckUtils]: 22: Hoare triple {2398#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,702 INFO L280 TraceCheckUtils]: 23: Hoare triple {2398#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,703 INFO L280 TraceCheckUtils]: 24: Hoare triple {2398#(<= main_~i~0 4)} havoc #t~nondet4; {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,704 INFO L280 TraceCheckUtils]: 25: Hoare triple {2398#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,704 INFO L280 TraceCheckUtils]: 26: Hoare triple {2399#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,705 INFO L280 TraceCheckUtils]: 27: Hoare triple {2399#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,705 INFO L280 TraceCheckUtils]: 28: Hoare triple {2399#(<= main_~i~0 5)} havoc #t~nondet4; {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,706 INFO L280 TraceCheckUtils]: 29: Hoare triple {2399#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2400#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:34,707 INFO L280 TraceCheckUtils]: 30: Hoare triple {2400#(<= main_~i~0 6)} assume !(~i~0 < 10); {2390#false} is VALID [2020-07-29 01:17:34,707 INFO L280 TraceCheckUtils]: 31: Hoare triple {2390#false} assume 0 == ~p~0.offset; {2390#false} is VALID [2020-07-29 01:17:34,707 INFO L280 TraceCheckUtils]: 32: Hoare triple {2390#false} assume ~p~0.base < #StackHeapBarrier; {2390#false} is VALID [2020-07-29 01:17:34,707 INFO L280 TraceCheckUtils]: 33: Hoare triple {2390#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {2390#false} is VALID [2020-07-29 01:17:34,707 INFO L280 TraceCheckUtils]: 34: Hoare triple {2390#false} assume !(1 == #valid[~p~0.base]); {2390#false} is VALID [2020-07-29 01:17:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:34,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354661594] [2020-07-29 01:17:34,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165814084] [2020-07-29 01:17:34,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:34,752 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:17:34,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:34,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:17:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:34,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:34,973 INFO L263 TraceCheckUtils]: 0: Hoare triple {2389#true} call ULTIMATE.init(); {2389#true} is VALID [2020-07-29 01:17:34,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {2389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2389#true} is VALID [2020-07-29 01:17:34,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {2389#true} assume true; {2389#true} is VALID [2020-07-29 01:17:34,974 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2389#true} {2389#true} #49#return; {2389#true} is VALID [2020-07-29 01:17:34,974 INFO L263 TraceCheckUtils]: 4: Hoare triple {2389#true} call #t~ret7 := main(); {2389#true} is VALID [2020-07-29 01:17:34,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {2389#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2420#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:34,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {2420#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2420#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:34,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {2420#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2420#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:34,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {2420#(<= main_~i~0 0)} havoc #t~nondet4; {2420#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:34,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {2420#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {2395#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {2395#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {2395#(<= main_~i~0 1)} havoc #t~nondet4; {2395#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:34,979 INFO L280 TraceCheckUtils]: 13: Hoare triple {2395#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,980 INFO L280 TraceCheckUtils]: 14: Hoare triple {2396#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,982 INFO L280 TraceCheckUtils]: 15: Hoare triple {2396#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {2396#(<= main_~i~0 2)} havoc #t~nondet4; {2396#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:34,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {2396#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,984 INFO L280 TraceCheckUtils]: 18: Hoare triple {2397#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,985 INFO L280 TraceCheckUtils]: 19: Hoare triple {2397#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,985 INFO L280 TraceCheckUtils]: 20: Hoare triple {2397#(<= main_~i~0 3)} havoc #t~nondet4; {2397#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:34,986 INFO L280 TraceCheckUtils]: 21: Hoare triple {2397#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,987 INFO L280 TraceCheckUtils]: 22: Hoare triple {2398#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {2398#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,988 INFO L280 TraceCheckUtils]: 24: Hoare triple {2398#(<= main_~i~0 4)} havoc #t~nondet4; {2398#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:34,988 INFO L280 TraceCheckUtils]: 25: Hoare triple {2398#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,988 INFO L280 TraceCheckUtils]: 26: Hoare triple {2399#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,989 INFO L280 TraceCheckUtils]: 27: Hoare triple {2399#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,989 INFO L280 TraceCheckUtils]: 28: Hoare triple {2399#(<= main_~i~0 5)} havoc #t~nondet4; {2399#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:34,990 INFO L280 TraceCheckUtils]: 29: Hoare triple {2399#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2400#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:34,990 INFO L280 TraceCheckUtils]: 30: Hoare triple {2400#(<= main_~i~0 6)} assume !(~i~0 < 10); {2390#false} is VALID [2020-07-29 01:17:34,990 INFO L280 TraceCheckUtils]: 31: Hoare triple {2390#false} assume 0 == ~p~0.offset; {2390#false} is VALID [2020-07-29 01:17:34,991 INFO L280 TraceCheckUtils]: 32: Hoare triple {2390#false} assume ~p~0.base < #StackHeapBarrier; {2390#false} is VALID [2020-07-29 01:17:34,991 INFO L280 TraceCheckUtils]: 33: Hoare triple {2390#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {2390#false} is VALID [2020-07-29 01:17:34,991 INFO L280 TraceCheckUtils]: 34: Hoare triple {2390#false} assume !(1 == #valid[~p~0.base]); {2390#false} is VALID [2020-07-29 01:17:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:34,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:34,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-29 01:17:34,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627713681] [2020-07-29 01:17:34,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-29 01:17:34,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:34,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:17:35,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:35,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:17:35,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:35,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:17:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:17:35,041 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 11 states. [2020-07-29 01:17:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:35,207 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-29 01:17:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:17:35,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-29 01:17:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:17:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2020-07-29 01:17:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:17:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2020-07-29 01:17:35,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2020-07-29 01:17:35,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:35,275 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:17:35,275 INFO L226 Difference]: Without dead ends: 52 [2020-07-29 01:17:35,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:17:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-29 01:17:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-29 01:17:35,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:35,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2020-07-29 01:17:35,279 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2020-07-29 01:17:35,279 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2020-07-29 01:17:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:35,280 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-29 01:17:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-29 01:17:35,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:35,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:35,281 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2020-07-29 01:17:35,281 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2020-07-29 01:17:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:35,283 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-29 01:17:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-29 01:17:35,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:35,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:35,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:35,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:17:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-29 01:17:35,285 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 35 [2020-07-29 01:17:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:35,285 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-29 01:17:35,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:17:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-29 01:17:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-29 01:17:35,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:35,286 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:35,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:35,500 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 719470310, now seen corresponding path program 5 times [2020-07-29 01:17:35,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:35,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812725455] [2020-07-29 01:17:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:35,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:35,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {2725#(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; {2712#true} is VALID [2020-07-29 01:17:35,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {2712#true} assume true; {2712#true} is VALID [2020-07-29 01:17:35,641 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2712#true} {2712#true} #49#return; {2712#true} is VALID [2020-07-29 01:17:35,641 INFO L263 TraceCheckUtils]: 0: Hoare triple {2712#true} call ULTIMATE.init(); {2725#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:35,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {2725#(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; {2712#true} is VALID [2020-07-29 01:17:35,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {2712#true} assume true; {2712#true} is VALID [2020-07-29 01:17:35,642 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2712#true} {2712#true} #49#return; {2712#true} is VALID [2020-07-29 01:17:35,642 INFO L263 TraceCheckUtils]: 4: Hoare triple {2712#true} call #t~ret7 := main(); {2712#true} is VALID [2020-07-29 01:17:35,643 INFO L280 TraceCheckUtils]: 5: Hoare triple {2712#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2717#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:35,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {2717#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2717#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:35,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {2717#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2717#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:35,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {2717#(= 0 main_~i~0)} havoc #t~nondet4; {2717#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:35,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {2717#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:35,645 INFO L280 TraceCheckUtils]: 10: Hoare triple {2718#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:35,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {2718#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:35,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {2718#(<= main_~i~0 1)} havoc #t~nondet4; {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:35,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {2718#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:35,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {2719#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:35,647 INFO L280 TraceCheckUtils]: 15: Hoare triple {2719#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:35,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {2719#(<= main_~i~0 2)} havoc #t~nondet4; {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:35,649 INFO L280 TraceCheckUtils]: 17: Hoare triple {2719#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:35,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {2720#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:35,650 INFO L280 TraceCheckUtils]: 19: Hoare triple {2720#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:35,651 INFO L280 TraceCheckUtils]: 20: Hoare triple {2720#(<= main_~i~0 3)} havoc #t~nondet4; {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:35,652 INFO L280 TraceCheckUtils]: 21: Hoare triple {2720#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:35,652 INFO L280 TraceCheckUtils]: 22: Hoare triple {2721#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:35,653 INFO L280 TraceCheckUtils]: 23: Hoare triple {2721#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:35,654 INFO L280 TraceCheckUtils]: 24: Hoare triple {2721#(<= main_~i~0 4)} havoc #t~nondet4; {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:35,654 INFO L280 TraceCheckUtils]: 25: Hoare triple {2721#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:35,655 INFO L280 TraceCheckUtils]: 26: Hoare triple {2722#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:35,655 INFO L280 TraceCheckUtils]: 27: Hoare triple {2722#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:35,656 INFO L280 TraceCheckUtils]: 28: Hoare triple {2722#(<= main_~i~0 5)} havoc #t~nondet4; {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:35,656 INFO L280 TraceCheckUtils]: 29: Hoare triple {2722#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:35,657 INFO L280 TraceCheckUtils]: 30: Hoare triple {2723#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:35,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {2723#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:35,658 INFO L280 TraceCheckUtils]: 32: Hoare triple {2723#(<= main_~i~0 6)} havoc #t~nondet4; {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:35,659 INFO L280 TraceCheckUtils]: 33: Hoare triple {2723#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2724#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:35,660 INFO L280 TraceCheckUtils]: 34: Hoare triple {2724#(<= main_~i~0 7)} assume !(~i~0 < 10); {2713#false} is VALID [2020-07-29 01:17:35,660 INFO L280 TraceCheckUtils]: 35: Hoare triple {2713#false} assume 0 == ~p~0.offset; {2713#false} is VALID [2020-07-29 01:17:35,660 INFO L280 TraceCheckUtils]: 36: Hoare triple {2713#false} assume ~p~0.base < #StackHeapBarrier; {2713#false} is VALID [2020-07-29 01:17:35,661 INFO L280 TraceCheckUtils]: 37: Hoare triple {2713#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {2713#false} is VALID [2020-07-29 01:17:35,661 INFO L280 TraceCheckUtils]: 38: Hoare triple {2713#false} assume !(1 == #valid[~p~0.base]); {2713#false} is VALID [2020-07-29 01:17:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:35,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812725455] [2020-07-29 01:17:35,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342144400] [2020-07-29 01:17:35,664 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:35,720 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-07-29 01:17:35,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:35,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:17:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:35,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:35,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {2712#true} call ULTIMATE.init(); {2712#true} is VALID [2020-07-29 01:17:35,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {2712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2712#true} is VALID [2020-07-29 01:17:35,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {2712#true} assume true; {2712#true} is VALID [2020-07-29 01:17:35,992 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2712#true} {2712#true} #49#return; {2712#true} is VALID [2020-07-29 01:17:35,992 INFO L263 TraceCheckUtils]: 4: Hoare triple {2712#true} call #t~ret7 := main(); {2712#true} is VALID [2020-07-29 01:17:36,003 INFO L280 TraceCheckUtils]: 5: Hoare triple {2712#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2744#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:36,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {2744#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2744#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:36,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {2744#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2744#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:36,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {2744#(<= main_~i~0 0)} havoc #t~nondet4; {2744#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:36,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {2744#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,006 INFO L280 TraceCheckUtils]: 10: Hoare triple {2718#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {2718#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,007 INFO L280 TraceCheckUtils]: 12: Hoare triple {2718#(<= main_~i~0 1)} havoc #t~nondet4; {2718#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,008 INFO L280 TraceCheckUtils]: 13: Hoare triple {2718#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,009 INFO L280 TraceCheckUtils]: 14: Hoare triple {2719#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,009 INFO L280 TraceCheckUtils]: 15: Hoare triple {2719#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,010 INFO L280 TraceCheckUtils]: 16: Hoare triple {2719#(<= main_~i~0 2)} havoc #t~nondet4; {2719#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,017 INFO L280 TraceCheckUtils]: 17: Hoare triple {2719#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,018 INFO L280 TraceCheckUtils]: 18: Hoare triple {2720#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,019 INFO L280 TraceCheckUtils]: 19: Hoare triple {2720#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {2720#(<= main_~i~0 3)} havoc #t~nondet4; {2720#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,020 INFO L280 TraceCheckUtils]: 21: Hoare triple {2720#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,020 INFO L280 TraceCheckUtils]: 22: Hoare triple {2721#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,021 INFO L280 TraceCheckUtils]: 23: Hoare triple {2721#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,021 INFO L280 TraceCheckUtils]: 24: Hoare triple {2721#(<= main_~i~0 4)} havoc #t~nondet4; {2721#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,022 INFO L280 TraceCheckUtils]: 25: Hoare triple {2721#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,022 INFO L280 TraceCheckUtils]: 26: Hoare triple {2722#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,023 INFO L280 TraceCheckUtils]: 27: Hoare triple {2722#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,023 INFO L280 TraceCheckUtils]: 28: Hoare triple {2722#(<= main_~i~0 5)} havoc #t~nondet4; {2722#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,024 INFO L280 TraceCheckUtils]: 29: Hoare triple {2722#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,025 INFO L280 TraceCheckUtils]: 30: Hoare triple {2723#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,025 INFO L280 TraceCheckUtils]: 31: Hoare triple {2723#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,026 INFO L280 TraceCheckUtils]: 32: Hoare triple {2723#(<= main_~i~0 6)} havoc #t~nondet4; {2723#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,027 INFO L280 TraceCheckUtils]: 33: Hoare triple {2723#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2724#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:36,027 INFO L280 TraceCheckUtils]: 34: Hoare triple {2724#(<= main_~i~0 7)} assume !(~i~0 < 10); {2713#false} is VALID [2020-07-29 01:17:36,027 INFO L280 TraceCheckUtils]: 35: Hoare triple {2713#false} assume 0 == ~p~0.offset; {2713#false} is VALID [2020-07-29 01:17:36,027 INFO L280 TraceCheckUtils]: 36: Hoare triple {2713#false} assume ~p~0.base < #StackHeapBarrier; {2713#false} is VALID [2020-07-29 01:17:36,028 INFO L280 TraceCheckUtils]: 37: Hoare triple {2713#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {2713#false} is VALID [2020-07-29 01:17:36,028 INFO L280 TraceCheckUtils]: 38: Hoare triple {2713#false} assume !(1 == #valid[~p~0.base]); {2713#false} is VALID [2020-07-29 01:17:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:36,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:36,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-07-29 01:17:36,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240145665] [2020-07-29 01:17:36,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-29 01:17:36,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:36,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:17:36,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:36,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:17:36,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:17:36,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:36,095 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 12 states. [2020-07-29 01:17:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:36,333 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-29 01:17:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:17:36,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-29 01:17:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:17:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2020-07-29 01:17:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:17:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2020-07-29 01:17:36,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 59 transitions. [2020-07-29 01:17:36,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:36,416 INFO L225 Difference]: With dead ends: 56 [2020-07-29 01:17:36,417 INFO L226 Difference]: Without dead ends: 56 [2020-07-29 01:17:36,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-29 01:17:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2020-07-29 01:17:36,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:36,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 53 states. [2020-07-29 01:17:36,421 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 53 states. [2020-07-29 01:17:36,421 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 53 states. [2020-07-29 01:17:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:36,422 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-29 01:17:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-29 01:17:36,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:36,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:36,423 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 56 states. [2020-07-29 01:17:36,423 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 56 states. [2020-07-29 01:17:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:36,425 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-29 01:17:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-29 01:17:36,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:36,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:36,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:36,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 01:17:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-29 01:17:36,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 39 [2020-07-29 01:17:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:36,427 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-29 01:17:36,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:17:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-29 01:17:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-29 01:17:36,428 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:36,428 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:36,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:36,634 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1920487677, now seen corresponding path program 6 times [2020-07-29 01:17:36,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:36,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80705367] [2020-07-29 01:17:36,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:36,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:36,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {3078#(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; {3064#true} is VALID [2020-07-29 01:17:36,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {3064#true} assume true; {3064#true} is VALID [2020-07-29 01:17:36,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3064#true} {3064#true} #49#return; {3064#true} is VALID [2020-07-29 01:17:36,817 INFO L263 TraceCheckUtils]: 0: Hoare triple {3064#true} call ULTIMATE.init(); {3078#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:36,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {3078#(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; {3064#true} is VALID [2020-07-29 01:17:36,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {3064#true} assume true; {3064#true} is VALID [2020-07-29 01:17:36,818 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3064#true} {3064#true} #49#return; {3064#true} is VALID [2020-07-29 01:17:36,818 INFO L263 TraceCheckUtils]: 4: Hoare triple {3064#true} call #t~ret7 := main(); {3064#true} is VALID [2020-07-29 01:17:36,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {3064#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3069#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:36,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {3069#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3069#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:36,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {3069#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3069#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:36,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {3069#(= 0 main_~i~0)} havoc #t~nondet4; {3069#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:36,820 INFO L280 TraceCheckUtils]: 9: Hoare triple {3069#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,821 INFO L280 TraceCheckUtils]: 10: Hoare triple {3070#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,821 INFO L280 TraceCheckUtils]: 11: Hoare triple {3070#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,822 INFO L280 TraceCheckUtils]: 12: Hoare triple {3070#(<= main_~i~0 1)} havoc #t~nondet4; {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:36,823 INFO L280 TraceCheckUtils]: 13: Hoare triple {3070#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,823 INFO L280 TraceCheckUtils]: 14: Hoare triple {3071#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,823 INFO L280 TraceCheckUtils]: 15: Hoare triple {3071#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {3071#(<= main_~i~0 2)} havoc #t~nondet4; {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:36,825 INFO L280 TraceCheckUtils]: 17: Hoare triple {3071#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,825 INFO L280 TraceCheckUtils]: 18: Hoare triple {3072#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,825 INFO L280 TraceCheckUtils]: 19: Hoare triple {3072#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,826 INFO L280 TraceCheckUtils]: 20: Hoare triple {3072#(<= main_~i~0 3)} havoc #t~nondet4; {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:36,827 INFO L280 TraceCheckUtils]: 21: Hoare triple {3072#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,827 INFO L280 TraceCheckUtils]: 22: Hoare triple {3073#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,827 INFO L280 TraceCheckUtils]: 23: Hoare triple {3073#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,828 INFO L280 TraceCheckUtils]: 24: Hoare triple {3073#(<= main_~i~0 4)} havoc #t~nondet4; {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:36,829 INFO L280 TraceCheckUtils]: 25: Hoare triple {3073#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,829 INFO L280 TraceCheckUtils]: 26: Hoare triple {3074#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,829 INFO L280 TraceCheckUtils]: 27: Hoare triple {3074#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,830 INFO L280 TraceCheckUtils]: 28: Hoare triple {3074#(<= main_~i~0 5)} havoc #t~nondet4; {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:36,831 INFO L280 TraceCheckUtils]: 29: Hoare triple {3074#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,831 INFO L280 TraceCheckUtils]: 30: Hoare triple {3075#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,831 INFO L280 TraceCheckUtils]: 31: Hoare triple {3075#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,832 INFO L280 TraceCheckUtils]: 32: Hoare triple {3075#(<= main_~i~0 6)} havoc #t~nondet4; {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:36,833 INFO L280 TraceCheckUtils]: 33: Hoare triple {3075#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:36,833 INFO L280 TraceCheckUtils]: 34: Hoare triple {3076#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:36,833 INFO L280 TraceCheckUtils]: 35: Hoare triple {3076#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:36,834 INFO L280 TraceCheckUtils]: 36: Hoare triple {3076#(<= main_~i~0 7)} havoc #t~nondet4; {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:36,834 INFO L280 TraceCheckUtils]: 37: Hoare triple {3076#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3077#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:36,835 INFO L280 TraceCheckUtils]: 38: Hoare triple {3077#(<= main_~i~0 8)} assume !(~i~0 < 10); {3065#false} is VALID [2020-07-29 01:17:36,835 INFO L280 TraceCheckUtils]: 39: Hoare triple {3065#false} assume 0 == ~p~0.offset; {3065#false} is VALID [2020-07-29 01:17:36,835 INFO L280 TraceCheckUtils]: 40: Hoare triple {3065#false} assume ~p~0.base < #StackHeapBarrier; {3065#false} is VALID [2020-07-29 01:17:36,835 INFO L280 TraceCheckUtils]: 41: Hoare triple {3065#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {3065#false} is VALID [2020-07-29 01:17:36,835 INFO L280 TraceCheckUtils]: 42: Hoare triple {3065#false} assume !(1 == #valid[~p~0.base]); {3065#false} is VALID [2020-07-29 01:17:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:36,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80705367] [2020-07-29 01:17:36,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464376562] [2020-07-29 01:17:36,837 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:36,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2020-07-29 01:17:36,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:36,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:17:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:36,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:37,130 INFO L263 TraceCheckUtils]: 0: Hoare triple {3064#true} call ULTIMATE.init(); {3064#true} is VALID [2020-07-29 01:17:37,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {3064#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3064#true} is VALID [2020-07-29 01:17:37,131 INFO L280 TraceCheckUtils]: 2: Hoare triple {3064#true} assume true; {3064#true} is VALID [2020-07-29 01:17:37,131 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3064#true} {3064#true} #49#return; {3064#true} is VALID [2020-07-29 01:17:37,132 INFO L263 TraceCheckUtils]: 4: Hoare triple {3064#true} call #t~ret7 := main(); {3064#true} is VALID [2020-07-29 01:17:37,132 INFO L280 TraceCheckUtils]: 5: Hoare triple {3064#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3097#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:37,133 INFO L280 TraceCheckUtils]: 6: Hoare triple {3097#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3097#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:37,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {3097#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3097#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:37,134 INFO L280 TraceCheckUtils]: 8: Hoare triple {3097#(<= main_~i~0 0)} havoc #t~nondet4; {3097#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:37,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {3097#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:37,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {3070#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:37,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {3070#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:37,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {3070#(<= main_~i~0 1)} havoc #t~nondet4; {3070#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:37,136 INFO L280 TraceCheckUtils]: 13: Hoare triple {3070#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:37,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {3071#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:37,137 INFO L280 TraceCheckUtils]: 15: Hoare triple {3071#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:37,137 INFO L280 TraceCheckUtils]: 16: Hoare triple {3071#(<= main_~i~0 2)} havoc #t~nondet4; {3071#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:37,138 INFO L280 TraceCheckUtils]: 17: Hoare triple {3071#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:37,138 INFO L280 TraceCheckUtils]: 18: Hoare triple {3072#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:37,139 INFO L280 TraceCheckUtils]: 19: Hoare triple {3072#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:37,139 INFO L280 TraceCheckUtils]: 20: Hoare triple {3072#(<= main_~i~0 3)} havoc #t~nondet4; {3072#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:37,139 INFO L280 TraceCheckUtils]: 21: Hoare triple {3072#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:37,140 INFO L280 TraceCheckUtils]: 22: Hoare triple {3073#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:37,140 INFO L280 TraceCheckUtils]: 23: Hoare triple {3073#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:37,141 INFO L280 TraceCheckUtils]: 24: Hoare triple {3073#(<= main_~i~0 4)} havoc #t~nondet4; {3073#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:37,141 INFO L280 TraceCheckUtils]: 25: Hoare triple {3073#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:37,141 INFO L280 TraceCheckUtils]: 26: Hoare triple {3074#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:37,142 INFO L280 TraceCheckUtils]: 27: Hoare triple {3074#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:37,142 INFO L280 TraceCheckUtils]: 28: Hoare triple {3074#(<= main_~i~0 5)} havoc #t~nondet4; {3074#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:37,143 INFO L280 TraceCheckUtils]: 29: Hoare triple {3074#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:37,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {3075#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:37,143 INFO L280 TraceCheckUtils]: 31: Hoare triple {3075#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:37,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {3075#(<= main_~i~0 6)} havoc #t~nondet4; {3075#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:37,144 INFO L280 TraceCheckUtils]: 33: Hoare triple {3075#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:37,145 INFO L280 TraceCheckUtils]: 34: Hoare triple {3076#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:37,145 INFO L280 TraceCheckUtils]: 35: Hoare triple {3076#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:37,145 INFO L280 TraceCheckUtils]: 36: Hoare triple {3076#(<= main_~i~0 7)} havoc #t~nondet4; {3076#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:37,146 INFO L280 TraceCheckUtils]: 37: Hoare triple {3076#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3077#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:37,146 INFO L280 TraceCheckUtils]: 38: Hoare triple {3077#(<= main_~i~0 8)} assume !(~i~0 < 10); {3065#false} is VALID [2020-07-29 01:17:37,147 INFO L280 TraceCheckUtils]: 39: Hoare triple {3065#false} assume 0 == ~p~0.offset; {3065#false} is VALID [2020-07-29 01:17:37,147 INFO L280 TraceCheckUtils]: 40: Hoare triple {3065#false} assume ~p~0.base < #StackHeapBarrier; {3065#false} is VALID [2020-07-29 01:17:37,147 INFO L280 TraceCheckUtils]: 41: Hoare triple {3065#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {3065#false} is VALID [2020-07-29 01:17:37,147 INFO L280 TraceCheckUtils]: 42: Hoare triple {3065#false} assume !(1 == #valid[~p~0.base]); {3065#false} is VALID [2020-07-29 01:17:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:37,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:37,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-07-29 01:17:37,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906831455] [2020-07-29 01:17:37,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-07-29 01:17:37,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:37,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:17:37,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:37,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:17:37,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:17:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:17:37,211 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 13 states. [2020-07-29 01:17:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:37,490 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-29 01:17:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:17:37,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-07-29 01:17:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:17:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2020-07-29 01:17:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:17:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2020-07-29 01:17:37,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2020-07-29 01:17:37,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:37,575 INFO L225 Difference]: With dead ends: 60 [2020-07-29 01:17:37,575 INFO L226 Difference]: Without dead ends: 60 [2020-07-29 01:17:37,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:17:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-29 01:17:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2020-07-29 01:17:37,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:37,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 57 states. [2020-07-29 01:17:37,581 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 57 states. [2020-07-29 01:17:37,581 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 57 states. [2020-07-29 01:17:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:37,584 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-29 01:17:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-07-29 01:17:37,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:37,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:37,585 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 60 states. [2020-07-29 01:17:37,585 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 60 states. [2020-07-29 01:17:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:37,587 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-29 01:17:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-07-29 01:17:37,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:37,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:37,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:37,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-29 01:17:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-07-29 01:17:37,590 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 43 [2020-07-29 01:17:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:37,590 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-07-29 01:17:37,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:17:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-07-29 01:17:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-29 01:17:37,592 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:37,592 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:37,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-29 01:17:37,809 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1099810976, now seen corresponding path program 7 times [2020-07-29 01:17:37,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:37,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607737153] [2020-07-29 01:17:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:38,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:38,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {3460#(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; {3445#true} is VALID [2020-07-29 01:17:38,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {3445#true} assume true; {3445#true} is VALID [2020-07-29 01:17:38,013 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3445#true} {3445#true} #49#return; {3445#true} is VALID [2020-07-29 01:17:38,014 INFO L263 TraceCheckUtils]: 0: Hoare triple {3445#true} call ULTIMATE.init(); {3460#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:38,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {3460#(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; {3445#true} is VALID [2020-07-29 01:17:38,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {3445#true} assume true; {3445#true} is VALID [2020-07-29 01:17:38,015 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3445#true} {3445#true} #49#return; {3445#true} is VALID [2020-07-29 01:17:38,015 INFO L263 TraceCheckUtils]: 4: Hoare triple {3445#true} call #t~ret7 := main(); {3445#true} is VALID [2020-07-29 01:17:38,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {3445#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3450#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:38,016 INFO L280 TraceCheckUtils]: 6: Hoare triple {3450#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3450#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:38,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {3450#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3450#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:38,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {3450#(= 0 main_~i~0)} havoc #t~nondet4; {3450#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:38,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {3450#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,017 INFO L280 TraceCheckUtils]: 10: Hoare triple {3451#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {3451#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {3451#(<= main_~i~0 1)} havoc #t~nondet4; {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {3451#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {3452#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,019 INFO L280 TraceCheckUtils]: 15: Hoare triple {3452#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,020 INFO L280 TraceCheckUtils]: 16: Hoare triple {3452#(<= main_~i~0 2)} havoc #t~nondet4; {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,020 INFO L280 TraceCheckUtils]: 17: Hoare triple {3452#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,021 INFO L280 TraceCheckUtils]: 18: Hoare triple {3453#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,021 INFO L280 TraceCheckUtils]: 19: Hoare triple {3453#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,022 INFO L280 TraceCheckUtils]: 20: Hoare triple {3453#(<= main_~i~0 3)} havoc #t~nondet4; {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,026 INFO L280 TraceCheckUtils]: 21: Hoare triple {3453#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,029 INFO L280 TraceCheckUtils]: 22: Hoare triple {3454#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,029 INFO L280 TraceCheckUtils]: 23: Hoare triple {3454#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,030 INFO L280 TraceCheckUtils]: 24: Hoare triple {3454#(<= main_~i~0 4)} havoc #t~nondet4; {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,031 INFO L280 TraceCheckUtils]: 25: Hoare triple {3454#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,032 INFO L280 TraceCheckUtils]: 26: Hoare triple {3455#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,032 INFO L280 TraceCheckUtils]: 27: Hoare triple {3455#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,033 INFO L280 TraceCheckUtils]: 28: Hoare triple {3455#(<= main_~i~0 5)} havoc #t~nondet4; {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,034 INFO L280 TraceCheckUtils]: 29: Hoare triple {3455#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,034 INFO L280 TraceCheckUtils]: 30: Hoare triple {3456#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,035 INFO L280 TraceCheckUtils]: 31: Hoare triple {3456#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,036 INFO L280 TraceCheckUtils]: 32: Hoare triple {3456#(<= main_~i~0 6)} havoc #t~nondet4; {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,037 INFO L280 TraceCheckUtils]: 33: Hoare triple {3456#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,037 INFO L280 TraceCheckUtils]: 34: Hoare triple {3457#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,038 INFO L280 TraceCheckUtils]: 35: Hoare triple {3457#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,038 INFO L280 TraceCheckUtils]: 36: Hoare triple {3457#(<= main_~i~0 7)} havoc #t~nondet4; {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,039 INFO L280 TraceCheckUtils]: 37: Hoare triple {3457#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,040 INFO L280 TraceCheckUtils]: 38: Hoare triple {3458#(<= main_~i~0 8)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,041 INFO L280 TraceCheckUtils]: 39: Hoare triple {3458#(<= main_~i~0 8)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,041 INFO L280 TraceCheckUtils]: 40: Hoare triple {3458#(<= main_~i~0 8)} havoc #t~nondet4; {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,042 INFO L280 TraceCheckUtils]: 41: Hoare triple {3458#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3459#(<= main_~i~0 9)} is VALID [2020-07-29 01:17:38,043 INFO L280 TraceCheckUtils]: 42: Hoare triple {3459#(<= main_~i~0 9)} assume !(~i~0 < 10); {3446#false} is VALID [2020-07-29 01:17:38,043 INFO L280 TraceCheckUtils]: 43: Hoare triple {3446#false} assume 0 == ~p~0.offset; {3446#false} is VALID [2020-07-29 01:17:38,043 INFO L280 TraceCheckUtils]: 44: Hoare triple {3446#false} assume ~p~0.base < #StackHeapBarrier; {3446#false} is VALID [2020-07-29 01:17:38,043 INFO L280 TraceCheckUtils]: 45: Hoare triple {3446#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {3446#false} is VALID [2020-07-29 01:17:38,043 INFO L280 TraceCheckUtils]: 46: Hoare triple {3446#false} assume !(1 == #valid[~p~0.base]); {3446#false} is VALID [2020-07-29 01:17:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:38,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607737153] [2020-07-29 01:17:38,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625843251] [2020-07-29 01:17:38,046 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:38,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:17:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:38,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:38,358 INFO L263 TraceCheckUtils]: 0: Hoare triple {3445#true} call ULTIMATE.init(); {3445#true} is VALID [2020-07-29 01:17:38,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {3445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3445#true} is VALID [2020-07-29 01:17:38,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {3445#true} assume true; {3445#true} is VALID [2020-07-29 01:17:38,359 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3445#true} {3445#true} #49#return; {3445#true} is VALID [2020-07-29 01:17:38,359 INFO L263 TraceCheckUtils]: 4: Hoare triple {3445#true} call #t~ret7 := main(); {3445#true} is VALID [2020-07-29 01:17:38,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {3445#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3479#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:38,361 INFO L280 TraceCheckUtils]: 6: Hoare triple {3479#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3479#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:38,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {3479#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3479#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:38,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {3479#(<= main_~i~0 0)} havoc #t~nondet4; {3479#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:38,362 INFO L280 TraceCheckUtils]: 9: Hoare triple {3479#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,363 INFO L280 TraceCheckUtils]: 10: Hoare triple {3451#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,363 INFO L280 TraceCheckUtils]: 11: Hoare triple {3451#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {3451#(<= main_~i~0 1)} havoc #t~nondet4; {3451#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:38,364 INFO L280 TraceCheckUtils]: 13: Hoare triple {3451#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {3452#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,365 INFO L280 TraceCheckUtils]: 15: Hoare triple {3452#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {3452#(<= main_~i~0 2)} havoc #t~nondet4; {3452#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:38,366 INFO L280 TraceCheckUtils]: 17: Hoare triple {3452#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {3453#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {3453#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,371 INFO L280 TraceCheckUtils]: 20: Hoare triple {3453#(<= main_~i~0 3)} havoc #t~nondet4; {3453#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:38,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {3453#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,372 INFO L280 TraceCheckUtils]: 22: Hoare triple {3454#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,373 INFO L280 TraceCheckUtils]: 23: Hoare triple {3454#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,373 INFO L280 TraceCheckUtils]: 24: Hoare triple {3454#(<= main_~i~0 4)} havoc #t~nondet4; {3454#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:38,374 INFO L280 TraceCheckUtils]: 25: Hoare triple {3454#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,374 INFO L280 TraceCheckUtils]: 26: Hoare triple {3455#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,375 INFO L280 TraceCheckUtils]: 27: Hoare triple {3455#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,375 INFO L280 TraceCheckUtils]: 28: Hoare triple {3455#(<= main_~i~0 5)} havoc #t~nondet4; {3455#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:38,376 INFO L280 TraceCheckUtils]: 29: Hoare triple {3455#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,376 INFO L280 TraceCheckUtils]: 30: Hoare triple {3456#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,376 INFO L280 TraceCheckUtils]: 31: Hoare triple {3456#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,377 INFO L280 TraceCheckUtils]: 32: Hoare triple {3456#(<= main_~i~0 6)} havoc #t~nondet4; {3456#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:38,377 INFO L280 TraceCheckUtils]: 33: Hoare triple {3456#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,378 INFO L280 TraceCheckUtils]: 34: Hoare triple {3457#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,378 INFO L280 TraceCheckUtils]: 35: Hoare triple {3457#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,379 INFO L280 TraceCheckUtils]: 36: Hoare triple {3457#(<= main_~i~0 7)} havoc #t~nondet4; {3457#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:38,379 INFO L280 TraceCheckUtils]: 37: Hoare triple {3457#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,380 INFO L280 TraceCheckUtils]: 38: Hoare triple {3458#(<= main_~i~0 8)} assume !!(~i~0 < 10);assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,380 INFO L280 TraceCheckUtils]: 39: Hoare triple {3458#(<= main_~i~0 8)} SUMMARY for call write~int(#t~nondet4, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L11 {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,380 INFO L280 TraceCheckUtils]: 40: Hoare triple {3458#(<= main_~i~0 8)} havoc #t~nondet4; {3458#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:38,381 INFO L280 TraceCheckUtils]: 41: Hoare triple {3458#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3459#(<= main_~i~0 9)} is VALID [2020-07-29 01:17:38,382 INFO L280 TraceCheckUtils]: 42: Hoare triple {3459#(<= main_~i~0 9)} assume !(~i~0 < 10); {3446#false} is VALID [2020-07-29 01:17:38,382 INFO L280 TraceCheckUtils]: 43: Hoare triple {3446#false} assume 0 == ~p~0.offset; {3446#false} is VALID [2020-07-29 01:17:38,382 INFO L280 TraceCheckUtils]: 44: Hoare triple {3446#false} assume ~p~0.base < #StackHeapBarrier; {3446#false} is VALID [2020-07-29 01:17:38,382 INFO L280 TraceCheckUtils]: 45: Hoare triple {3446#false} assume 0 == ~p~0.base || 1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {3446#false} is VALID [2020-07-29 01:17:38,382 INFO L280 TraceCheckUtils]: 46: Hoare triple {3446#false} assume !(1 == #valid[~p~0.base]); {3446#false} is VALID [2020-07-29 01:17:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:38,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:38,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-07-29 01:17:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803586476] [2020-07-29 01:17:38,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2020-07-29 01:17:38,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:38,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:17:38,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:38,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-29 01:17:38,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:17:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:17:38,453 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 14 states. [2020-07-29 01:17:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:38,695 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-29 01:17:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:17:38,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2020-07-29 01:17:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:17:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2020-07-29 01:17:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:17:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2020-07-29 01:17:38,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2020-07-29 01:17:38,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:38,770 INFO L225 Difference]: With dead ends: 61 [2020-07-29 01:17:38,770 INFO L226 Difference]: Without dead ends: 61 [2020-07-29 01:17:38,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:17:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-29 01:17:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-29 01:17:38,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:38,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2020-07-29 01:17:38,774 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-29 01:17:38,775 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-29 01:17:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:38,777 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-29 01:17:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-29 01:17:38,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:38,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:38,778 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-29 01:17:38,778 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-29 01:17:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:38,780 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-29 01:17:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-29 01:17:38,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:38,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:38,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:38,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-29 01:17:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-07-29 01:17:38,783 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 47 [2020-07-29 01:17:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:38,783 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-07-29 01:17:38,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-29 01:17:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-29 01:17:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-29 01:17:38,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:38,785 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:38,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-29 01:17:38,999 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2020-07-29 01:17:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash -343684163, now seen corresponding path program 8 times [2020-07-29 01:17:38,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:39,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676772628] [2020-07-29 01:17:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:39,029 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:39,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:39,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:17:39,078 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:17:39,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-29 01:17:39,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:17:39 BoogieIcfgContainer [2020-07-29 01:17:39,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:17:39,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:17:39,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:17:39,117 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:17:39,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:25" (3/4) ... [2020-07-29 01:17:39,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:17:39,183 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:17:39,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:17:39,185 INFO L168 Benchmark]: Toolchain (without parser) took 14187.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.7 MB). Free memory was 957.5 MB in the beginning and 837.0 MB in the end (delta: 120.6 MB). Peak memory consumption was 383.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:39,186 INFO L168 Benchmark]: CDTParser took 0.52 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:17:39,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.10 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:39,187 INFO L168 Benchmark]: Boogie Preprocessor took 113.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:39,187 INFO L168 Benchmark]: RCFGBuilder took 501.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:39,188 INFO L168 Benchmark]: TraceAbstraction took 13238.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.0 GB in the beginning and 837.0 MB in the end (delta: 201.8 MB). Peak memory consumption was 382.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:39,188 INFO L168 Benchmark]: Witness Printer took 66.88 ms. Allocated memory is still 1.3 GB. Free memory is still 837.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:39,190 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.52 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 260.10 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 501.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13238.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.0 GB in the beginning and 837.0 MB in the end (delta: 201.8 MB). Peak memory consumption was 382.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.88 ms. Allocated memory is still 1.3 GB. Free memory is still 837.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-1, i=0, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, i=1, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-3, i=2, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, i=3, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-5, i=4, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-6, i=5, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, i=6, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, i=7, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-9, i=8, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=10, i=9, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={-10:0}, p={-10:0}] [L14] free(p) [L16] p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 17, TraceHistogramMax: 10, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 329 SDtfs, 232 SDslu, 806 SDs, 0 SdLazy, 850 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 341 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 49 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 737 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 56427 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 31/1106 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...