./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.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/freeAlloca.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 bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:17:17,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:17,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:17,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:17,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:17,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:17,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:17,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:17,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:17,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:17,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:17,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:17,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:17,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:17,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:17,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:17,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:17,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:17,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:17,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:17,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:17,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:17,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:17,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:17,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:17,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:17,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:17,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:17,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:17,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:17,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:17,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:17,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:17,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:17,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:17,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:17,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:17,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:17,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:17,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:17,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:17,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:17:17,448 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:17,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:17,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:17,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:17,452 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:17,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:17,453 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:17:17,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:17,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:17,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:17:17,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:17,455 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:17,455 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:17,456 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:17,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:17,456 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:17,457 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:17:17,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:17,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:17,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:17,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:17,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:17,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:17,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:17,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:17,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:17,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:17,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:17,460 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 -> bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 [2020-07-29 01:17:17,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:17,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:17,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:17,847 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:17,849 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:17,850 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2020-07-29 01:17:17,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c1de3d4/0be6fd8907f74999ba4d7138634b0613/FLAG419e3c5d1 [2020-07-29 01:17:18,368 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:18,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2020-07-29 01:17:18,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c1de3d4/0be6fd8907f74999ba4d7138634b0613/FLAG419e3c5d1 [2020-07-29 01:17:18,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c1de3d4/0be6fd8907f74999ba4d7138634b0613 [2020-07-29 01:17:18,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:18,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:18,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:18,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:18,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0cb75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:18,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:18,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,956 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:18,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,987 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:18,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18 WrapperNode [2020-07-29 01:17:18,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:18,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:18,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:19,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:19,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:19,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:19,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:19,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:19,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:19,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:19,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:19,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:19,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:17:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:17:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-29 01:17:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:17:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:19,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:19,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:19,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:19,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:19,470 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:19,471 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:17:19,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:19 BoogieIcfgContainer [2020-07-29 01:17:19,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:19,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:19,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:19,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:19,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:17:18" (1/3) ... [2020-07-29 01:17:19,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d63b861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:19, skipping insertion in model container [2020-07-29 01:17:19,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (2/3) ... [2020-07-29 01:17:19,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d63b861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:19, skipping insertion in model container [2020-07-29 01:17:19,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:19" (3/3) ... [2020-07-29 01:17:19,490 INFO L109 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2020-07-29 01:17:19,505 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:19,515 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-29 01:17:19,530 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-29 01:17:19,554 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:19,554 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:19,555 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:19,555 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:19,555 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:19,555 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:19,556 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:19,556 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-29 01:17:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:19,583 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:19,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:19,584 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2020-07-29 01:17:19,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:19,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204309322] [2020-07-29 01:17:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2020-07-29 01:17:19,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-29 01:17:19,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #42#return; {31#true} is VALID [2020-07-29 01:17:19,822 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:19,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2020-07-29 01:17:19,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-29 01:17:19,824 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #42#return; {31#true} is VALID [2020-07-29 01:17:19,824 INFO L263 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2020-07-29 01:17:19,824 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {31#true} is VALID [2020-07-29 01:17:19,826 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-29 01:17:19,826 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} assume !(1 == #valid[~p~0.base]); {32#false} is VALID [2020-07-29 01:17:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:19,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204309322] [2020-07-29 01:17:19,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:19,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:19,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34688842] [2020-07-29 01:17:19,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-29 01:17:19,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:19,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:17:19,875 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:19,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:17:19,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:17:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:17:19,890 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-07-29 01:17:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,036 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:17:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:17:20,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-29 01:17:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:17:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-07-29 01:17:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:17:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-07-29 01:17:20,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2020-07-29 01:17:20,103 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:20,115 INFO L225 Difference]: With dead ends: 28 [2020-07-29 01:17:20,116 INFO L226 Difference]: Without dead ends: 25 [2020-07-29 01:17:20,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:17:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-29 01:17:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 01:17:20,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-29 01:17:20,154 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-29 01:17:20,155 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-29 01:17:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,159 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:17:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:17:20,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,161 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-29 01:17:20,161 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-29 01:17:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,165 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:17:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:17:20,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:17:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-29 01:17:20,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2020-07-29 01:17:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,172 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-29 01:17:20,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:17:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:17:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:20,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:17:20,175 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2020-07-29 01:17:20,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756121450] [2020-07-29 01:17:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {148#(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; {142#true} is VALID [2020-07-29 01:17:20,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2020-07-29 01:17:20,295 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2020-07-29 01:17:20,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:20,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#(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; {142#true} is VALID [2020-07-29 01:17:20,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2020-07-29 01:17:20,298 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2020-07-29 01:17:20,298 INFO L263 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2020-07-29 01:17:20,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {147#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:20,301 INFO L280 TraceCheckUtils]: 6: Hoare triple {147#(= 0 main_~i~0)} assume !(~i~0 < 10); {143#false} is VALID [2020-07-29 01:17:20,302 INFO L280 TraceCheckUtils]: 7: Hoare triple {143#false} assume !(1 == #valid[~p~0.base]); {143#false} is VALID [2020-07-29 01:17:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756121450] [2020-07-29 01:17:20,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:20,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:17:20,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067179403] [2020-07-29 01:17:20,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:20,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:20,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:20,325 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:20,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:20,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:20,327 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2020-07-29 01:17:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,495 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 01:17:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:20,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2020-07-29 01:17:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2020-07-29 01:17:20,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2020-07-29 01:17:20,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,562 INFO L225 Difference]: With dead ends: 31 [2020-07-29 01:17:20,562 INFO L226 Difference]: Without dead ends: 31 [2020-07-29 01:17:20,563 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:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-29 01:17:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-07-29 01:17:20,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 26 states. [2020-07-29 01:17:20,568 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 26 states. [2020-07-29 01:17:20,569 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 26 states. [2020-07-29 01:17:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,572 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 01:17:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-29 01:17:20,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,574 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 31 states. [2020-07-29 01:17:20,574 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 31 states. [2020-07-29 01:17:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,578 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 01:17:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-29 01:17:20,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:17:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-29 01:17:20,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2020-07-29 01:17:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,583 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-29 01:17:20,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:20,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:17:20,586 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2020-07-29 01:17:20,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187872250] [2020-07-29 01:17:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#(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; {270#true} is VALID [2020-07-29 01:17:20,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#true} assume true; {270#true} is VALID [2020-07-29 01:17:20,740 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {270#true} {270#true} #42#return; {270#true} is VALID [2020-07-29 01:17:20,743 INFO L263 TraceCheckUtils]: 0: Hoare triple {270#true} call ULTIMATE.init(); {276#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:20,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {276#(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; {270#true} is VALID [2020-07-29 01:17:20,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {270#true} assume true; {270#true} is VALID [2020-07-29 01:17:20,744 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {270#true} {270#true} #42#return; {270#true} is VALID [2020-07-29 01:17:20,744 INFO L263 TraceCheckUtils]: 4: Hoare triple {270#true} call #t~ret5 := main(); {270#true} is VALID [2020-07-29 01:17:20,747 INFO L280 TraceCheckUtils]: 5: Hoare triple {270#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {275#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {275#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {275#(and (= 0 main_~p~0.offset) (= 10 (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); {271#false} is VALID [2020-07-29 01:17:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187872250] [2020-07-29 01:17:20,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:20,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:20,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569290974] [2020-07-29 01:17:20,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:20,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:20,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:20,772 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:20,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:20,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:20,774 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2020-07-29 01:17:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,923 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:20,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 01:17:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 01:17:20,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2020-07-29 01:17:20,970 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:20,972 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:17:20,972 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:17:20,973 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:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:17:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-29 01:17:20,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-29 01:17:20,980 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-29 01:17:20,980 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-29 01:17:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,987 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:20,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,989 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-29 01:17:20,989 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-29 01:17:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,997 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:20,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:17:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-29 01:17:21,002 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2020-07-29 01:17:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:21,002 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-29 01:17:21,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-29 01:17:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:21,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:21,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:21,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:17:21,005 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2020-07-29 01:17:21,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:21,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632559947] [2020-07-29 01:17:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {402#(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; {396#true} is VALID [2020-07-29 01:17:21,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {396#true} assume true; {396#true} is VALID [2020-07-29 01:17:21,062 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {396#true} {396#true} #42#return; {396#true} is VALID [2020-07-29 01:17:21,064 INFO L263 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {402#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:21,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#(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; {396#true} is VALID [2020-07-29 01:17:21,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {396#true} assume true; {396#true} is VALID [2020-07-29 01:17:21,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {396#true} {396#true} #42#return; {396#true} is VALID [2020-07-29 01:17:21,066 INFO L263 TraceCheckUtils]: 4: Hoare triple {396#true} call #t~ret5 := main(); {396#true} is VALID [2020-07-29 01:17:21,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {396#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {401#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:21,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {401#(= 1 (select |#valid| main_~p~0.base))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {401#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:21,070 INFO L280 TraceCheckUtils]: 7: Hoare triple {401#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {397#false} is VALID [2020-07-29 01:17:21,071 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:21,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632559947] [2020-07-29 01:17:21,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:21,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:21,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082034214] [2020-07-29 01:17:21,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:21,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:21,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:21,086 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:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:21,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:21,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:21,087 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2020-07-29 01:17:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,213 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:17:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:21,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:17:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:17:21,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2020-07-29 01:17:21,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,259 INFO L225 Difference]: With dead ends: 25 [2020-07-29 01:17:21,259 INFO L226 Difference]: Without dead ends: 25 [2020-07-29 01:17:21,259 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:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-29 01:17:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-29 01:17:21,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:21,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2020-07-29 01:17:21,263 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2020-07-29 01:17:21,264 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2020-07-29 01:17:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,266 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:17:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:17:21,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,267 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2020-07-29 01:17:21,268 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2020-07-29 01:17:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,270 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:17:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:17:21,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:21,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:17:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-29 01:17:21,274 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2020-07-29 01:17:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:21,274 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-29 01:17:21,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:17:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:21,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:21,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:21,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:17:21,277 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2020-07-29 01:17:21,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:21,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36867411] [2020-07-29 01:17:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#(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; {504#true} is VALID [2020-07-29 01:17:21,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {504#true} assume true; {504#true} is VALID [2020-07-29 01:17:21,355 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {504#true} {504#true} #42#return; {504#true} is VALID [2020-07-29 01:17:21,357 INFO L263 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {511#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:21,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(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; {504#true} is VALID [2020-07-29 01:17:21,357 INFO L280 TraceCheckUtils]: 2: Hoare triple {504#true} assume true; {504#true} is VALID [2020-07-29 01:17:21,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {504#true} {504#true} #42#return; {504#true} is VALID [2020-07-29 01:17:21,358 INFO L263 TraceCheckUtils]: 4: Hoare triple {504#true} call #t~ret5 := main(); {504#true} is VALID [2020-07-29 01:17:21,360 INFO L280 TraceCheckUtils]: 5: Hoare triple {504#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {509#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:21,361 INFO L280 TraceCheckUtils]: 6: Hoare triple {509#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {509#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:21,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {509#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {509#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:21,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {509#(= 0 main_~i~0)} havoc #t~nondet3; {509#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:21,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {509#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {510#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:21,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {510#(<= main_~i~0 1)} assume !(~i~0 < 10); {505#false} is VALID [2020-07-29 01:17:21,365 INFO L280 TraceCheckUtils]: 11: Hoare triple {505#false} assume !(1 + (2 + ~p~0.offset) <= #length[~p~0.base] && 0 <= 2 + ~p~0.offset); {505#false} is VALID [2020-07-29 01:17:21,366 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:21,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36867411] [2020-07-29 01:17:21,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129055273] [2020-07-29 01:17:21,367 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:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:17:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:21,548 INFO L263 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {504#true} is VALID [2020-07-29 01:17:21,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {504#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {504#true} is VALID [2020-07-29 01:17:21,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {504#true} assume true; {504#true} is VALID [2020-07-29 01:17:21,549 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {504#true} {504#true} #42#return; {504#true} is VALID [2020-07-29 01:17:21,550 INFO L263 TraceCheckUtils]: 4: Hoare triple {504#true} call #t~ret5 := main(); {504#true} is VALID [2020-07-29 01:17:21,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {504#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {530#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:21,552 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {530#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:21,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {530#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {530#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:21,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#(<= main_~i~0 0)} havoc #t~nondet3; {530#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:21,555 INFO L280 TraceCheckUtils]: 9: Hoare triple {530#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {510#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:21,556 INFO L280 TraceCheckUtils]: 10: Hoare triple {510#(<= main_~i~0 1)} assume !(~i~0 < 10); {505#false} is VALID [2020-07-29 01:17:21,557 INFO L280 TraceCheckUtils]: 11: Hoare triple {505#false} assume !(1 + (2 + ~p~0.offset) <= #length[~p~0.base] && 0 <= 2 + ~p~0.offset); {505#false} is VALID [2020-07-29 01:17:21,558 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:21,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:21,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-29 01:17:21,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534236214] [2020-07-29 01:17:21,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 01:17:21,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:21,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:17:21,586 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:21,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:17:21,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:17:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:17:21,588 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2020-07-29 01:17:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,727 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 01:17:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:21,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 01:17:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:17:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:17:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:17:21,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-29 01:17:21,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,786 INFO L225 Difference]: With dead ends: 31 [2020-07-29 01:17:21,786 INFO L226 Difference]: Without dead ends: 31 [2020-07-29 01:17:21,787 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:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-29 01:17:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-29 01:17:21,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:21,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 27 states. [2020-07-29 01:17:21,790 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 27 states. [2020-07-29 01:17:21,791 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 27 states. [2020-07-29 01:17:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,793 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 01:17:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-29 01:17:21,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,794 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states. [2020-07-29 01:17:21,794 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states. [2020-07-29 01:17:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,797 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-29 01:17:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-29 01:17:21,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:21,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:17:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-29 01:17:21,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 12 [2020-07-29 01:17:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:21,801 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-29 01:17:21,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:17:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-29 01:17:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:21,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:21,802 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:22,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:22,017 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:22,017 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2020-07-29 01:17:22,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:22,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531054932] [2020-07-29 01:17:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {675#(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; {668#true} is VALID [2020-07-29 01:17:22,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-29 01:17:22,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #42#return; {668#true} is VALID [2020-07-29 01:17:22,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {675#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:22,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {675#(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; {668#true} is VALID [2020-07-29 01:17:22,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-29 01:17:22,122 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #42#return; {668#true} is VALID [2020-07-29 01:17:22,122 INFO L263 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret5 := main(); {668#true} is VALID [2020-07-29 01:17:22,124 INFO L280 TraceCheckUtils]: 5: Hoare triple {668#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,125 INFO L280 TraceCheckUtils]: 6: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,126 INFO L280 TraceCheckUtils]: 7: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet3; {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,128 INFO L280 TraceCheckUtils]: 9: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {674#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:22,129 INFO L280 TraceCheckUtils]: 10: Hoare triple {674#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {674#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:22,130 INFO L280 TraceCheckUtils]: 11: Hoare triple {674#(and (= 0 main_~p~0.offset) (= 10 (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); {669#false} is VALID [2020-07-29 01:17:22,131 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:22,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531054932] [2020-07-29 01:17:22,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782846932] [2020-07-29 01:17:22,131 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:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:17:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:22,226 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:22,227 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:22,248 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:22,249 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:22,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:22,253 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:22,253 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_9|]. (and (= 0 main_~p~0.offset) (= (store |v_#length_9| main_~p~0.base 10) |#length|) (= 0 main_~i~0)) [2020-07-29 01:17:22,254 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0)) [2020-07-29 01:17:22,288 INFO L263 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2020-07-29 01:17:22,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {668#true} is VALID [2020-07-29 01:17:22,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2020-07-29 01:17:22,291 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #42#return; {668#true} is VALID [2020-07-29 01:17:22,291 INFO L263 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret5 := main(); {668#true} is VALID [2020-07-29 01:17:22,293 INFO L280 TraceCheckUtils]: 5: Hoare triple {668#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,294 INFO L280 TraceCheckUtils]: 6: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,296 INFO L280 TraceCheckUtils]: 7: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,297 INFO L280 TraceCheckUtils]: 8: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet3; {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:22,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {673#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {674#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:22,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {674#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {674#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:22,301 INFO L280 TraceCheckUtils]: 11: Hoare triple {674#(and (= 0 main_~p~0.offset) (= 10 (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); {669#false} is VALID [2020-07-29 01:17:22,302 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:22,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:22,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:17:22,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293932846] [2020-07-29 01:17:22,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:22,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:22,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:17:22,323 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:22,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:17:22,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:17:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:22,325 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2020-07-29 01:17:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,508 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:22,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:17:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:17:22,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-29 01:17:22,583 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:22,584 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:17:22,584 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:17:22,584 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:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:17:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-29 01:17:22,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:22,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-29 01:17:22,587 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-29 01:17:22,587 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-29 01:17:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,589 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:22,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:22,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:22,590 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-29 01:17:22,590 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-29 01:17:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,591 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:22,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:22,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:22,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:22,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 01:17:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-29 01:17:22,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2020-07-29 01:17:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:22,594 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-29 01:17:22,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:17:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-29 01:17:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:17:22,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:22,595 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:22,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:22,809 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:22,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:22,810 INFO L82 PathProgramCache]: Analyzing trace with hash 355533743, now seen corresponding path program 2 times [2020-07-29 01:17:22,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:22,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430609442] [2020-07-29 01:17:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,883 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:22,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-29 01:17:22,883 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #42#return; {829#true} is VALID [2020-07-29 01:17:22,885 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:22,885 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:22,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-29 01:17:22,886 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {829#true} {829#true} #42#return; {829#true} is VALID [2020-07-29 01:17:22,886 INFO L263 TraceCheckUtils]: 4: Hoare triple {829#true} call #t~ret5 := main(); {829#true} is VALID [2020-07-29 01:17:22,887 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,888 INFO L280 TraceCheckUtils]: 6: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} havoc #t~nondet3; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,893 INFO L280 TraceCheckUtils]: 11: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} havoc #t~nondet3; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,896 INFO L280 TraceCheckUtils]: 14: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !(~i~0 < 10); {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:22,897 INFO L280 TraceCheckUtils]: 15: Hoare triple {834#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !(1 + (2 + ~p~0.offset) <= #length[~p~0.base] && 0 <= 2 + ~p~0.offset); {830#false} is VALID [2020-07-29 01:17:22,898 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:22,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430609442] [2020-07-29 01:17:22,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:22,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:22,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522771463] [2020-07-29 01:17:22,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-29 01:17:22,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:22,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:22,915 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:22,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:22,916 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2020-07-29 01:17:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,003 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-29 01:17:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:23,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-29 01:17:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-07-29 01:17:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-07-29 01:17:23,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2020-07-29 01:17:23,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,049 INFO L225 Difference]: With dead ends: 26 [2020-07-29 01:17:23,050 INFO L226 Difference]: Without dead ends: 26 [2020-07-29 01:17:23,050 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:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-29 01:17:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-29 01:17:23,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:23,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-29 01:17:23,053 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-29 01:17:23,053 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-29 01:17:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,054 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-29 01:17:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:23,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,055 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-29 01:17:23,055 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-29 01:17:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,057 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-29 01:17:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:23,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:23,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:17:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-29 01:17:23,060 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2020-07-29 01:17:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:23,060 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-29 01:17:23,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:17:23,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:23,061 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:23,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:17:23,061 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 355533796, now seen corresponding path program 2 times [2020-07-29 01:17:23,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:23,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329230096] [2020-07-29 01:17:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {951#(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; {942#true} is VALID [2020-07-29 01:17:23,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2020-07-29 01:17:23,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #42#return; {942#true} is VALID [2020-07-29 01:17:23,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {951#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:23,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {951#(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; {942#true} is VALID [2020-07-29 01:17:23,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {942#true} assume true; {942#true} is VALID [2020-07-29 01:17:23,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {942#true} {942#true} #42#return; {942#true} is VALID [2020-07-29 01:17:23,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {942#true} call #t~ret5 := main(); {942#true} is VALID [2020-07-29 01:17:23,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {942#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet3; {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,207 INFO L280 TraceCheckUtils]: 9: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:23,208 INFO L280 TraceCheckUtils]: 10: Hoare triple {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:23,209 INFO L280 TraceCheckUtils]: 11: Hoare triple {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:23,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} havoc #t~nondet3; {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:23,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {948#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {949#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,212 INFO L280 TraceCheckUtils]: 14: Hoare triple {949#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {950#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} is VALID [2020-07-29 01:17:23,213 INFO L280 TraceCheckUtils]: 15: Hoare triple {950#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (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); {943#false} is VALID [2020-07-29 01:17:23,215 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:23,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329230096] [2020-07-29 01:17:23,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42463876] [2020-07-29 01:17:23,215 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:23,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:23,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:23,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:17:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:23,281 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:23,282 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:23,290 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:23,291 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:23,291 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:23,296 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:23,296 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_10|]. (and (= 0 main_~p~0.offset) (= |#length| (store |v_#length_10| main_~p~0.base 10)) (= 0 main_~i~0)) [2020-07-29 01:17:23,297 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0)) [2020-07-29 01:17:23,369 INFO L263 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2020-07-29 01:17:23,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {942#true} is VALID [2020-07-29 01:17:23,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {942#true} assume true; {942#true} is VALID [2020-07-29 01:17:23,370 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {942#true} {942#true} #42#return; {942#true} is VALID [2020-07-29 01:17:23,370 INFO L263 TraceCheckUtils]: 4: Hoare triple {942#true} call #t~ret5 := main(); {942#true} is VALID [2020-07-29 01:17:23,372 INFO L280 TraceCheckUtils]: 5: Hoare triple {942#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,373 INFO L280 TraceCheckUtils]: 6: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} havoc #t~nondet3; {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:23,375 INFO L280 TraceCheckUtils]: 9: Hoare triple {947#(and (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,376 INFO L280 TraceCheckUtils]: 10: Hoare triple {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,377 INFO L280 TraceCheckUtils]: 12: Hoare triple {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} havoc #t~nondet3; {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,378 INFO L280 TraceCheckUtils]: 13: Hoare triple {982#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,378 INFO L280 TraceCheckUtils]: 14: Hoare triple {995#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {995#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:23,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 10 (select |#length| main_~p~0.base)))} assume !(1 + (~p~0.offset + ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + ~i~0); {943#false} is VALID [2020-07-29 01:17:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:23,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:23,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2020-07-29 01:17:23,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244604862] [2020-07-29 01:17:23,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 01:17:23,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:23,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:17:23,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:17:23,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:17:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:23,423 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2020-07-29 01:17:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,738 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:23,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 01:17:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2020-07-29 01:17:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2020-07-29 01:17:23,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2020-07-29 01:17:23,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,791 INFO L225 Difference]: With dead ends: 32 [2020-07-29 01:17:23,792 INFO L226 Difference]: Without dead ends: 32 [2020-07-29 01:17:23,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-29 01:17:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-29 01:17:23,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:23,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-29 01:17:23,798 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-29 01:17:23,798 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-29 01:17:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,801 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:23,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,802 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-29 01:17:23,802 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-29 01:17:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,804 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-29 01:17:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:23,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:23,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 01:17:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-29 01:17:23,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 16 [2020-07-29 01:17:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:23,812 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-29 01:17:23,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:17:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-29 01:17:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-29 01:17:23,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:23,813 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:24,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:24,029 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash 817658963, now seen corresponding path program 1 times [2020-07-29 01:17:24,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:24,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841334884] [2020-07-29 01:17:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {1139#(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; {1129#true} is VALID [2020-07-29 01:17:24,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-29 01:17:24,180 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1129#true} {1129#true} #42#return; {1129#true} is VALID [2020-07-29 01:17:24,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1139#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:24,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {1139#(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; {1129#true} is VALID [2020-07-29 01:17:24,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-29 01:17:24,181 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #42#return; {1129#true} is VALID [2020-07-29 01:17:24,181 INFO L263 TraceCheckUtils]: 4: Hoare triple {1129#true} call #t~ret5 := main(); {1129#true} is VALID [2020-07-29 01:17:24,184 INFO L280 TraceCheckUtils]: 5: Hoare triple {1129#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1134#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:24,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {1134#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1134#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:24,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {1134#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1134#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:24,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {1134#(= 0 main_~i~0)} havoc #t~nondet3; {1134#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:24,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {1134#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {1135#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {1135#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,187 INFO L280 TraceCheckUtils]: 12: Hoare triple {1135#(<= main_~i~0 1)} havoc #t~nondet3; {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,188 INFO L280 TraceCheckUtils]: 13: Hoare triple {1135#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,188 INFO L280 TraceCheckUtils]: 14: Hoare triple {1136#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,188 INFO L280 TraceCheckUtils]: 15: Hoare triple {1136#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,189 INFO L280 TraceCheckUtils]: 16: Hoare triple {1136#(<= main_~i~0 2)} havoc #t~nondet3; {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,189 INFO L280 TraceCheckUtils]: 17: Hoare triple {1136#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,190 INFO L280 TraceCheckUtils]: 18: Hoare triple {1137#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {1137#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,192 INFO L280 TraceCheckUtils]: 20: Hoare triple {1137#(<= main_~i~0 3)} havoc #t~nondet3; {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {1137#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1138#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:24,193 INFO L280 TraceCheckUtils]: 22: Hoare triple {1138#(<= main_~i~0 4)} assume !(~i~0 < 10); {1130#false} is VALID [2020-07-29 01:17:24,193 INFO L280 TraceCheckUtils]: 23: Hoare triple {1130#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1130#false} is VALID [2020-07-29 01:17:24,193 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#false} assume !(97 == #t~mem4);havoc #t~mem4; {1130#false} is VALID [2020-07-29 01:17:24,194 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#false} #res := 0;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {1130#false} is VALID [2020-07-29 01:17:24,194 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#false} assume !(#valid == old(#valid)); {1130#false} is VALID [2020-07-29 01:17:24,195 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:24,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841334884] [2020-07-29 01:17:24,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142910788] [2020-07-29 01:17:24,196 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:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:17:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:24,422 INFO L263 TraceCheckUtils]: 0: Hoare triple {1129#true} call ULTIMATE.init(); {1129#true} is VALID [2020-07-29 01:17:24,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {1129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1129#true} is VALID [2020-07-29 01:17:24,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2020-07-29 01:17:24,423 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1129#true} #42#return; {1129#true} is VALID [2020-07-29 01:17:24,423 INFO L263 TraceCheckUtils]: 4: Hoare triple {1129#true} call #t~ret5 := main(); {1129#true} is VALID [2020-07-29 01:17:24,424 INFO L280 TraceCheckUtils]: 5: Hoare triple {1129#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1158#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {1158#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1158#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {1158#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1158#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {1158#(<= main_~i~0 0)} havoc #t~nondet3; {1158#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,428 INFO L280 TraceCheckUtils]: 9: Hoare triple {1158#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,428 INFO L280 TraceCheckUtils]: 10: Hoare triple {1135#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,429 INFO L280 TraceCheckUtils]: 11: Hoare triple {1135#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,430 INFO L280 TraceCheckUtils]: 12: Hoare triple {1135#(<= main_~i~0 1)} havoc #t~nondet3; {1135#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {1135#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,432 INFO L280 TraceCheckUtils]: 14: Hoare triple {1136#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {1136#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,434 INFO L280 TraceCheckUtils]: 16: Hoare triple {1136#(<= main_~i~0 2)} havoc #t~nondet3; {1136#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,435 INFO L280 TraceCheckUtils]: 17: Hoare triple {1136#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,436 INFO L280 TraceCheckUtils]: 18: Hoare triple {1137#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,436 INFO L280 TraceCheckUtils]: 19: Hoare triple {1137#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {1137#(<= main_~i~0 3)} havoc #t~nondet3; {1137#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,438 INFO L280 TraceCheckUtils]: 21: Hoare triple {1137#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1138#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:24,439 INFO L280 TraceCheckUtils]: 22: Hoare triple {1138#(<= main_~i~0 4)} assume !(~i~0 < 10); {1130#false} is VALID [2020-07-29 01:17:24,440 INFO L280 TraceCheckUtils]: 23: Hoare triple {1130#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1130#false} is VALID [2020-07-29 01:17:24,440 INFO L280 TraceCheckUtils]: 24: Hoare triple {1130#false} assume !(97 == #t~mem4);havoc #t~mem4; {1130#false} is VALID [2020-07-29 01:17:24,440 INFO L280 TraceCheckUtils]: 25: Hoare triple {1130#false} #res := 0;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {1130#false} is VALID [2020-07-29 01:17:24,440 INFO L280 TraceCheckUtils]: 26: Hoare triple {1130#false} assume !(#valid == old(#valid)); {1130#false} is VALID [2020-07-29 01:17:24,443 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:24,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:24,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-29 01:17:24,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523841323] [2020-07-29 01:17:24,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-29 01:17:24,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:24,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:17:24,488 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:24,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:17:24,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:17:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:24,489 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 9 states. [2020-07-29 01:17:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,642 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-29 01:17:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:24,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-29 01:17:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 01:17:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 01:17:24,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2020-07-29 01:17:24,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:24,690 INFO L225 Difference]: With dead ends: 39 [2020-07-29 01:17:24,690 INFO L226 Difference]: Without dead ends: 39 [2020-07-29 01:17:24,691 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:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-29 01:17:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-29 01:17:24,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:24,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-29 01:17:24,697 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-29 01:17:24,698 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-29 01:17:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,701 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-29 01:17:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-29 01:17:24,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:24,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:24,701 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-29 01:17:24,701 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-29 01:17:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,703 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-07-29 01:17:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-07-29 01:17:24,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:24,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:24,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:24,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:17:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-29 01:17:24,715 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2020-07-29 01:17:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:24,715 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-29 01:17:24,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:17:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-29 01:17:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:17:24,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:24,716 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:24,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:24,925 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1119993296, now seen corresponding path program 2 times [2020-07-29 01:17:24,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:24,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431679118] [2020-07-29 01:17:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {1385#(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; {1374#true} is VALID [2020-07-29 01:17:25,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {1374#true} assume true; {1374#true} is VALID [2020-07-29 01:17:25,068 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1374#true} {1374#true} #42#return; {1374#true} is VALID [2020-07-29 01:17:25,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {1374#true} call ULTIMATE.init(); {1385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:25,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {1385#(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; {1374#true} is VALID [2020-07-29 01:17:25,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {1374#true} assume true; {1374#true} is VALID [2020-07-29 01:17:25,070 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1374#true} {1374#true} #42#return; {1374#true} is VALID [2020-07-29 01:17:25,070 INFO L263 TraceCheckUtils]: 4: Hoare triple {1374#true} call #t~ret5 := main(); {1374#true} is VALID [2020-07-29 01:17:25,071 INFO L280 TraceCheckUtils]: 5: Hoare triple {1374#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1379#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,072 INFO L280 TraceCheckUtils]: 6: Hoare triple {1379#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1379#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {1379#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1379#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {1379#(= 0 main_~i~0)} havoc #t~nondet3; {1379#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,074 INFO L280 TraceCheckUtils]: 9: Hoare triple {1379#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1380#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {1380#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1380#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,076 INFO L280 TraceCheckUtils]: 11: Hoare triple {1380#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1380#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {1380#(<= main_~i~0 1)} havoc #t~nondet3; {1380#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,077 INFO L280 TraceCheckUtils]: 13: Hoare triple {1380#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1381#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,077 INFO L280 TraceCheckUtils]: 14: Hoare triple {1381#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1381#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,078 INFO L280 TraceCheckUtils]: 15: Hoare triple {1381#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1381#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {1381#(<= main_~i~0 2)} havoc #t~nondet3; {1381#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,079 INFO L280 TraceCheckUtils]: 17: Hoare triple {1381#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1382#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,080 INFO L280 TraceCheckUtils]: 18: Hoare triple {1382#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1382#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {1382#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1382#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,081 INFO L280 TraceCheckUtils]: 20: Hoare triple {1382#(<= main_~i~0 3)} havoc #t~nondet3; {1382#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,082 INFO L280 TraceCheckUtils]: 21: Hoare triple {1382#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1383#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,083 INFO L280 TraceCheckUtils]: 22: Hoare triple {1383#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1383#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,084 INFO L280 TraceCheckUtils]: 23: Hoare triple {1383#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1383#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,085 INFO L280 TraceCheckUtils]: 24: Hoare triple {1383#(<= main_~i~0 4)} havoc #t~nondet3; {1383#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,085 INFO L280 TraceCheckUtils]: 25: Hoare triple {1383#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1384#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:25,086 INFO L280 TraceCheckUtils]: 26: Hoare triple {1384#(<= main_~i~0 5)} assume !(~i~0 < 10); {1375#false} is VALID [2020-07-29 01:17:25,086 INFO L280 TraceCheckUtils]: 27: Hoare triple {1375#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1375#false} is VALID [2020-07-29 01:17:25,086 INFO L280 TraceCheckUtils]: 28: Hoare triple {1375#false} assume !(97 == #t~mem4);havoc #t~mem4; {1375#false} is VALID [2020-07-29 01:17:25,086 INFO L280 TraceCheckUtils]: 29: Hoare triple {1375#false} #res := 0;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {1375#false} is VALID [2020-07-29 01:17:25,087 INFO L280 TraceCheckUtils]: 30: Hoare triple {1375#false} assume !(#valid == old(#valid)); {1375#false} is VALID [2020-07-29 01:17:25,089 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:25,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431679118] [2020-07-29 01:17:25,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202290465] [2020-07-29 01:17:25,090 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:25,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:17:25,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:25,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:17:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:25,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {1374#true} call ULTIMATE.init(); {1374#true} is VALID [2020-07-29 01:17:25,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {1374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1374#true} is VALID [2020-07-29 01:17:25,250 INFO L280 TraceCheckUtils]: 2: Hoare triple {1374#true} assume true; {1374#true} is VALID [2020-07-29 01:17:25,250 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1374#true} {1374#true} #42#return; {1374#true} is VALID [2020-07-29 01:17:25,251 INFO L263 TraceCheckUtils]: 4: Hoare triple {1374#true} call #t~ret5 := main(); {1401#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:17:25,252 INFO L280 TraceCheckUtils]: 5: Hoare triple {1401#(= |#valid| |old(#valid)|)} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,255 INFO L280 TraceCheckUtils]: 7: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,256 INFO L280 TraceCheckUtils]: 8: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} havoc #t~nondet3; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,256 INFO L280 TraceCheckUtils]: 9: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,257 INFO L280 TraceCheckUtils]: 10: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,258 INFO L280 TraceCheckUtils]: 11: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} havoc #t~nondet3; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} havoc #t~nondet3; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,264 INFO L280 TraceCheckUtils]: 18: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,265 INFO L280 TraceCheckUtils]: 19: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} havoc #t~nondet3; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,268 INFO L280 TraceCheckUtils]: 22: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,269 INFO L280 TraceCheckUtils]: 23: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,270 INFO L280 TraceCheckUtils]: 24: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} havoc #t~nondet3; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,271 INFO L280 TraceCheckUtils]: 26: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !(~i~0 < 10); {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,272 INFO L280 TraceCheckUtils]: 27: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,273 INFO L280 TraceCheckUtils]: 28: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} assume !(97 == #t~mem4);havoc #t~mem4; {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} is VALID [2020-07-29 01:17:25,275 INFO L280 TraceCheckUtils]: 29: Hoare triple {1405#(and (= 0 (select |old(#valid)| |main_#t~malloc1.base|)) (= (store |old(#valid)| |main_#t~malloc1.base| 1) |#valid|))} #res := 0;call ULTIMATE.dealloc(#t~malloc1.base, #t~malloc1.offset);havoc #t~malloc1.base, #t~malloc1.offset; {1478#(exists ((|v_main_#t~malloc1.base_4| Int)) (and (= 0 (select |old(#valid)| |v_main_#t~malloc1.base_4|)) (= |#valid| (store |old(#valid)| |v_main_#t~malloc1.base_4| 0))))} is VALID [2020-07-29 01:17:25,276 INFO L280 TraceCheckUtils]: 30: Hoare triple {1478#(exists ((|v_main_#t~malloc1.base_4| Int)) (and (= 0 (select |old(#valid)| |v_main_#t~malloc1.base_4|)) (= |#valid| (store |old(#valid)| |v_main_#t~malloc1.base_4| 0))))} assume !(#valid == old(#valid)); {1375#false} is VALID [2020-07-29 01:17:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-07-29 01:17:25,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:17:25,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2020-07-29 01:17:25,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507313506] [2020-07-29 01:17:25,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-29 01:17:25,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:25,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:17:25,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:25,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:17:25,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:25,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:17:25,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:25,299 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 5 states. [2020-07-29 01:17:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,418 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-29 01:17:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:25,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-29 01:17:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 01:17:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 01:17:25,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2020-07-29 01:17:25,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:25,467 INFO L225 Difference]: With dead ends: 38 [2020-07-29 01:17:25,468 INFO L226 Difference]: Without dead ends: 36 [2020-07-29 01:17:25,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-29 01:17:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-29 01:17:25,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:25,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-29 01:17:25,472 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-29 01:17:25,473 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-29 01:17:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,474 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-29 01:17:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-29 01:17:25,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:25,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:25,475 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-29 01:17:25,475 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-29 01:17:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,477 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-29 01:17:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-29 01:17:25,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:25,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:25,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:25,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:17:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-07-29 01:17:25,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2020-07-29 01:17:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:25,480 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-07-29 01:17:25,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:17:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-07-29 01:17:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:17:25,481 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:25,481 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:25,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-29 01:17:25,696 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:25,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 1 times [2020-07-29 01:17:25,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:25,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715837776] [2020-07-29 01:17:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,855 INFO L280 TraceCheckUtils]: 0: Hoare triple {1638#(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; {1627#true} is VALID [2020-07-29 01:17:25,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {1627#true} assume true; {1627#true} is VALID [2020-07-29 01:17:25,855 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1627#true} {1627#true} #42#return; {1627#true} is VALID [2020-07-29 01:17:25,856 INFO L263 TraceCheckUtils]: 0: Hoare triple {1627#true} call ULTIMATE.init(); {1638#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:25,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {1638#(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; {1627#true} is VALID [2020-07-29 01:17:25,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2020-07-29 01:17:25,857 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #42#return; {1627#true} is VALID [2020-07-29 01:17:25,857 INFO L263 TraceCheckUtils]: 4: Hoare triple {1627#true} call #t~ret5 := main(); {1627#true} is VALID [2020-07-29 01:17:25,858 INFO L280 TraceCheckUtils]: 5: Hoare triple {1627#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,859 INFO L280 TraceCheckUtils]: 6: Hoare triple {1632#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,859 INFO L280 TraceCheckUtils]: 7: Hoare triple {1632#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,860 INFO L280 TraceCheckUtils]: 8: Hoare triple {1632#(= 0 main_~i~0)} havoc #t~nondet3; {1632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:25,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {1632#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,861 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#(<= main_~i~0 1)} havoc #t~nondet3; {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:25,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {1634#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,863 INFO L280 TraceCheckUtils]: 15: Hoare triple {1634#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,864 INFO L280 TraceCheckUtils]: 16: Hoare triple {1634#(<= main_~i~0 2)} havoc #t~nondet3; {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:25,864 INFO L280 TraceCheckUtils]: 17: Hoare triple {1634#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,865 INFO L280 TraceCheckUtils]: 18: Hoare triple {1635#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,865 INFO L280 TraceCheckUtils]: 19: Hoare triple {1635#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,866 INFO L280 TraceCheckUtils]: 20: Hoare triple {1635#(<= main_~i~0 3)} havoc #t~nondet3; {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:25,866 INFO L280 TraceCheckUtils]: 21: Hoare triple {1635#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,867 INFO L280 TraceCheckUtils]: 22: Hoare triple {1636#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,867 INFO L280 TraceCheckUtils]: 23: Hoare triple {1636#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,868 INFO L280 TraceCheckUtils]: 24: Hoare triple {1636#(<= main_~i~0 4)} havoc #t~nondet3; {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:25,868 INFO L280 TraceCheckUtils]: 25: Hoare triple {1636#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1637#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:25,869 INFO L280 TraceCheckUtils]: 26: Hoare triple {1637#(<= main_~i~0 5)} assume !(~i~0 < 10); {1628#false} is VALID [2020-07-29 01:17:25,869 INFO L280 TraceCheckUtils]: 27: Hoare triple {1628#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1628#false} is VALID [2020-07-29 01:17:25,869 INFO L280 TraceCheckUtils]: 28: Hoare triple {1628#false} assume 97 == #t~mem4;havoc #t~mem4; {1628#false} is VALID [2020-07-29 01:17:25,869 INFO L280 TraceCheckUtils]: 29: Hoare triple {1628#false} assume 0 == ~p~0.offset; {1628#false} is VALID [2020-07-29 01:17:25,870 INFO L280 TraceCheckUtils]: 30: Hoare triple {1628#false} assume !(~p~0.base < #StackHeapBarrier); {1628#false} is VALID [2020-07-29 01:17:25,872 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:25,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715837776] [2020-07-29 01:17:25,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253064013] [2020-07-29 01:17:25,872 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:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:17:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:26,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {1627#true} call ULTIMATE.init(); {1627#true} is VALID [2020-07-29 01:17:26,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {1627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1627#true} is VALID [2020-07-29 01:17:26,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {1627#true} assume true; {1627#true} is VALID [2020-07-29 01:17:26,160 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1627#true} {1627#true} #42#return; {1627#true} is VALID [2020-07-29 01:17:26,160 INFO L263 TraceCheckUtils]: 4: Hoare triple {1627#true} call #t~ret5 := main(); {1627#true} is VALID [2020-07-29 01:17:26,161 INFO L280 TraceCheckUtils]: 5: Hoare triple {1627#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1657#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:26,162 INFO L280 TraceCheckUtils]: 6: Hoare triple {1657#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1657#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:26,162 INFO L280 TraceCheckUtils]: 7: Hoare triple {1657#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1657#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:26,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {1657#(<= main_~i~0 0)} havoc #t~nondet3; {1657#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:26,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {1657#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,164 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#(<= main_~i~0 1)} havoc #t~nondet3; {1633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,165 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {1634#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,166 INFO L280 TraceCheckUtils]: 15: Hoare triple {1634#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,166 INFO L280 TraceCheckUtils]: 16: Hoare triple {1634#(<= main_~i~0 2)} havoc #t~nondet3; {1634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,167 INFO L280 TraceCheckUtils]: 17: Hoare triple {1634#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,167 INFO L280 TraceCheckUtils]: 18: Hoare triple {1635#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,167 INFO L280 TraceCheckUtils]: 19: Hoare triple {1635#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,168 INFO L280 TraceCheckUtils]: 20: Hoare triple {1635#(<= main_~i~0 3)} havoc #t~nondet3; {1635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,168 INFO L280 TraceCheckUtils]: 21: Hoare triple {1635#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,169 INFO L280 TraceCheckUtils]: 22: Hoare triple {1636#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,169 INFO L280 TraceCheckUtils]: 23: Hoare triple {1636#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,169 INFO L280 TraceCheckUtils]: 24: Hoare triple {1636#(<= main_~i~0 4)} havoc #t~nondet3; {1636#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,170 INFO L280 TraceCheckUtils]: 25: Hoare triple {1636#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1637#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:26,171 INFO L280 TraceCheckUtils]: 26: Hoare triple {1637#(<= main_~i~0 5)} assume !(~i~0 < 10); {1628#false} is VALID [2020-07-29 01:17:26,171 INFO L280 TraceCheckUtils]: 27: Hoare triple {1628#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1628#false} is VALID [2020-07-29 01:17:26,171 INFO L280 TraceCheckUtils]: 28: Hoare triple {1628#false} assume 97 == #t~mem4;havoc #t~mem4; {1628#false} is VALID [2020-07-29 01:17:26,171 INFO L280 TraceCheckUtils]: 29: Hoare triple {1628#false} assume 0 == ~p~0.offset; {1628#false} is VALID [2020-07-29 01:17:26,171 INFO L280 TraceCheckUtils]: 30: Hoare triple {1628#false} assume !(~p~0.base < #StackHeapBarrier); {1628#false} is VALID [2020-07-29 01:17:26,173 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:26,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:26,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-29 01:17:26,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867937708] [2020-07-29 01:17:26,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-29 01:17:26,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:26,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:17:26,222 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:26,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:17:26,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:26,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:17:26,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:26,224 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 10 states. [2020-07-29 01:17:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,407 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-29 01:17:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:17:26,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-29 01:17:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-29 01:17:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-29 01:17:26,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-29 01:17:26,467 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,469 INFO L225 Difference]: With dead ends: 43 [2020-07-29 01:17:26,469 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 01:17:26,470 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:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 01:17:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-29 01:17:26,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:26,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2020-07-29 01:17:26,478 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2020-07-29 01:17:26,478 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2020-07-29 01:17:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,481 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-29 01:17:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-29 01:17:26,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:26,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:26,482 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2020-07-29 01:17:26,482 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2020-07-29 01:17:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:26,484 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-29 01:17:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-29 01:17:26,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:26,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:26,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:26,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:17:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-07-29 01:17:26,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2020-07-29 01:17:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:26,487 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-07-29 01:17:26,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:17:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-07-29 01:17:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-29 01:17:26,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:26,491 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:26,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:26,705 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 2 times [2020-07-29 01:17:26,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:26,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511208618] [2020-07-29 01:17:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {1913#(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; {1901#true} is VALID [2020-07-29 01:17:26,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-29 01:17:26,837 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1901#true} {1901#true} #42#return; {1901#true} is VALID [2020-07-29 01:17:26,838 INFO L263 TraceCheckUtils]: 0: Hoare triple {1901#true} call ULTIMATE.init(); {1913#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:26,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {1913#(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; {1901#true} is VALID [2020-07-29 01:17:26,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-29 01:17:26,838 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1901#true} {1901#true} #42#return; {1901#true} is VALID [2020-07-29 01:17:26,839 INFO L263 TraceCheckUtils]: 4: Hoare triple {1901#true} call #t~ret5 := main(); {1901#true} is VALID [2020-07-29 01:17:26,839 INFO L280 TraceCheckUtils]: 5: Hoare triple {1901#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1906#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:26,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {1906#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1906#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:26,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {1906#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1906#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:26,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {1906#(= 0 main_~i~0)} havoc #t~nondet3; {1906#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:26,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {1906#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,842 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,842 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,843 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#(<= main_~i~0 1)} havoc #t~nondet3; {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:26,844 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {1908#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,845 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,845 INFO L280 TraceCheckUtils]: 16: Hoare triple {1908#(<= main_~i~0 2)} havoc #t~nondet3; {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:26,846 INFO L280 TraceCheckUtils]: 17: Hoare triple {1908#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,846 INFO L280 TraceCheckUtils]: 18: Hoare triple {1909#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,847 INFO L280 TraceCheckUtils]: 19: Hoare triple {1909#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,847 INFO L280 TraceCheckUtils]: 20: Hoare triple {1909#(<= main_~i~0 3)} havoc #t~nondet3; {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:26,848 INFO L280 TraceCheckUtils]: 21: Hoare triple {1909#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,848 INFO L280 TraceCheckUtils]: 22: Hoare triple {1910#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,849 INFO L280 TraceCheckUtils]: 23: Hoare triple {1910#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,849 INFO L280 TraceCheckUtils]: 24: Hoare triple {1910#(<= main_~i~0 4)} havoc #t~nondet3; {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:26,850 INFO L280 TraceCheckUtils]: 25: Hoare triple {1910#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:26,851 INFO L280 TraceCheckUtils]: 26: Hoare triple {1911#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:26,851 INFO L280 TraceCheckUtils]: 27: Hoare triple {1911#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:26,852 INFO L280 TraceCheckUtils]: 28: Hoare triple {1911#(<= main_~i~0 5)} havoc #t~nondet3; {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:26,853 INFO L280 TraceCheckUtils]: 29: Hoare triple {1911#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1912#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:26,855 INFO L280 TraceCheckUtils]: 30: Hoare triple {1912#(<= main_~i~0 6)} assume !(~i~0 < 10); {1902#false} is VALID [2020-07-29 01:17:26,855 INFO L280 TraceCheckUtils]: 31: Hoare triple {1902#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1902#false} is VALID [2020-07-29 01:17:26,855 INFO L280 TraceCheckUtils]: 32: Hoare triple {1902#false} assume 97 == #t~mem4;havoc #t~mem4; {1902#false} is VALID [2020-07-29 01:17:26,856 INFO L280 TraceCheckUtils]: 33: Hoare triple {1902#false} assume 0 == ~p~0.offset; {1902#false} is VALID [2020-07-29 01:17:26,856 INFO L280 TraceCheckUtils]: 34: Hoare triple {1902#false} assume !(~p~0.base < #StackHeapBarrier); {1902#false} is VALID [2020-07-29 01:17:26,857 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:26,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511208618] [2020-07-29 01:17:26,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941826956] [2020-07-29 01:17:26,858 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:26,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:26,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:26,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:17:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:26,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:27,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {1901#true} call ULTIMATE.init(); {1901#true} is VALID [2020-07-29 01:17:27,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {1901#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1901#true} is VALID [2020-07-29 01:17:27,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {1901#true} assume true; {1901#true} is VALID [2020-07-29 01:17:27,111 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1901#true} {1901#true} #42#return; {1901#true} is VALID [2020-07-29 01:17:27,112 INFO L263 TraceCheckUtils]: 4: Hoare triple {1901#true} call #t~ret5 := main(); {1901#true} is VALID [2020-07-29 01:17:27,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {1901#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {1932#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,118 INFO L280 TraceCheckUtils]: 6: Hoare triple {1932#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1932#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {1932#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1932#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,125 INFO L280 TraceCheckUtils]: 8: Hoare triple {1932#(<= main_~i~0 0)} havoc #t~nondet3; {1932#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:27,126 INFO L280 TraceCheckUtils]: 9: Hoare triple {1932#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,127 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#(<= main_~i~0 1)} havoc #t~nondet3; {1907#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,130 INFO L280 TraceCheckUtils]: 14: Hoare triple {1908#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,130 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,131 INFO L280 TraceCheckUtils]: 16: Hoare triple {1908#(<= main_~i~0 2)} havoc #t~nondet3; {1908#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,132 INFO L280 TraceCheckUtils]: 17: Hoare triple {1908#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,132 INFO L280 TraceCheckUtils]: 18: Hoare triple {1909#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,133 INFO L280 TraceCheckUtils]: 19: Hoare triple {1909#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,138 INFO L280 TraceCheckUtils]: 20: Hoare triple {1909#(<= main_~i~0 3)} havoc #t~nondet3; {1909#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,139 INFO L280 TraceCheckUtils]: 21: Hoare triple {1909#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,139 INFO L280 TraceCheckUtils]: 22: Hoare triple {1910#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,140 INFO L280 TraceCheckUtils]: 23: Hoare triple {1910#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,140 INFO L280 TraceCheckUtils]: 24: Hoare triple {1910#(<= main_~i~0 4)} havoc #t~nondet3; {1910#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,141 INFO L280 TraceCheckUtils]: 25: Hoare triple {1910#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,141 INFO L280 TraceCheckUtils]: 26: Hoare triple {1911#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,141 INFO L280 TraceCheckUtils]: 27: Hoare triple {1911#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,142 INFO L280 TraceCheckUtils]: 28: Hoare triple {1911#(<= main_~i~0 5)} havoc #t~nondet3; {1911#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,142 INFO L280 TraceCheckUtils]: 29: Hoare triple {1911#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1912#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:27,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {1912#(<= main_~i~0 6)} assume !(~i~0 < 10); {1902#false} is VALID [2020-07-29 01:17:27,143 INFO L280 TraceCheckUtils]: 31: Hoare triple {1902#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {1902#false} is VALID [2020-07-29 01:17:27,143 INFO L280 TraceCheckUtils]: 32: Hoare triple {1902#false} assume 97 == #t~mem4;havoc #t~mem4; {1902#false} is VALID [2020-07-29 01:17:27,143 INFO L280 TraceCheckUtils]: 33: Hoare triple {1902#false} assume 0 == ~p~0.offset; {1902#false} is VALID [2020-07-29 01:17:27,143 INFO L280 TraceCheckUtils]: 34: Hoare triple {1902#false} assume !(~p~0.base < #StackHeapBarrier); {1902#false} is VALID [2020-07-29 01:17:27,147 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:27,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:27,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-29 01:17:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276735051] [2020-07-29 01:17:27,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-29 01:17:27,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:27,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:17:27,196 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:27,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:17:27,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:27,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:17:27,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:17:27,198 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2020-07-29 01:17:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,402 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-29 01:17:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:17:27,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-29 01:17:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:17:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-29 01:17:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:17:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-29 01:17:27,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-29 01:17:27,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:27,464 INFO L225 Difference]: With dead ends: 47 [2020-07-29 01:17:27,464 INFO L226 Difference]: Without dead ends: 47 [2020-07-29 01:17:27,465 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:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-29 01:17:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-07-29 01:17:27,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:27,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2020-07-29 01:17:27,468 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2020-07-29 01:17:27,468 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2020-07-29 01:17:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,470 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-29 01:17:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-29 01:17:27,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:27,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:27,471 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2020-07-29 01:17:27,472 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2020-07-29 01:17:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:27,474 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-29 01:17:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-29 01:17:27,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:27,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:27,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:27,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-29 01:17:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-07-29 01:17:27,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2020-07-29 01:17:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:27,477 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-07-29 01:17:27,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:17:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-29 01:17:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-29 01:17:27,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:27,479 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:27,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:27,694 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:27,694 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 3 times [2020-07-29 01:17:27,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:27,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115616781] [2020-07-29 01:17:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {2217#(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; {2204#true} is VALID [2020-07-29 01:17:27,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {2204#true} assume true; {2204#true} is VALID [2020-07-29 01:17:27,834 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2204#true} {2204#true} #42#return; {2204#true} is VALID [2020-07-29 01:17:27,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:27,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {2217#(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; {2204#true} is VALID [2020-07-29 01:17:27,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {2204#true} assume true; {2204#true} is VALID [2020-07-29 01:17:27,835 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2204#true} {2204#true} #42#return; {2204#true} is VALID [2020-07-29 01:17:27,835 INFO L263 TraceCheckUtils]: 4: Hoare triple {2204#true} call #t~ret5 := main(); {2204#true} is VALID [2020-07-29 01:17:27,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {2204#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {2209#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {2209#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2209#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {2209#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2209#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,837 INFO L280 TraceCheckUtils]: 8: Hoare triple {2209#(= 0 main_~i~0)} havoc #t~nondet3; {2209#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:27,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {2209#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {2210#(<= main_~i~0 1)} havoc #t~nondet3; {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:27,840 INFO L280 TraceCheckUtils]: 13: Hoare triple {2210#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {2211#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {2211#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,841 INFO L280 TraceCheckUtils]: 16: Hoare triple {2211#(<= main_~i~0 2)} havoc #t~nondet3; {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:27,842 INFO L280 TraceCheckUtils]: 17: Hoare triple {2211#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,842 INFO L280 TraceCheckUtils]: 18: Hoare triple {2212#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,843 INFO L280 TraceCheckUtils]: 19: Hoare triple {2212#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,843 INFO L280 TraceCheckUtils]: 20: Hoare triple {2212#(<= main_~i~0 3)} havoc #t~nondet3; {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:27,845 INFO L280 TraceCheckUtils]: 21: Hoare triple {2212#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,845 INFO L280 TraceCheckUtils]: 22: Hoare triple {2213#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,846 INFO L280 TraceCheckUtils]: 23: Hoare triple {2213#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,847 INFO L280 TraceCheckUtils]: 24: Hoare triple {2213#(<= main_~i~0 4)} havoc #t~nondet3; {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:27,848 INFO L280 TraceCheckUtils]: 25: Hoare triple {2213#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,848 INFO L280 TraceCheckUtils]: 26: Hoare triple {2214#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,849 INFO L280 TraceCheckUtils]: 27: Hoare triple {2214#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,850 INFO L280 TraceCheckUtils]: 28: Hoare triple {2214#(<= main_~i~0 5)} havoc #t~nondet3; {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:27,850 INFO L280 TraceCheckUtils]: 29: Hoare triple {2214#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:27,851 INFO L280 TraceCheckUtils]: 30: Hoare triple {2215#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:27,851 INFO L280 TraceCheckUtils]: 31: Hoare triple {2215#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:27,852 INFO L280 TraceCheckUtils]: 32: Hoare triple {2215#(<= main_~i~0 6)} havoc #t~nondet3; {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:27,852 INFO L280 TraceCheckUtils]: 33: Hoare triple {2215#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2216#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:27,853 INFO L280 TraceCheckUtils]: 34: Hoare triple {2216#(<= main_~i~0 7)} assume !(~i~0 < 10); {2205#false} is VALID [2020-07-29 01:17:27,853 INFO L280 TraceCheckUtils]: 35: Hoare triple {2205#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {2205#false} is VALID [2020-07-29 01:17:27,853 INFO L280 TraceCheckUtils]: 36: Hoare triple {2205#false} assume 97 == #t~mem4;havoc #t~mem4; {2205#false} is VALID [2020-07-29 01:17:27,853 INFO L280 TraceCheckUtils]: 37: Hoare triple {2205#false} assume 0 == ~p~0.offset; {2205#false} is VALID [2020-07-29 01:17:27,853 INFO L280 TraceCheckUtils]: 38: Hoare triple {2205#false} assume !(~p~0.base < #StackHeapBarrier); {2205#false} is VALID [2020-07-29 01:17:27,854 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:27,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115616781] [2020-07-29 01:17:27,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682233906] [2020-07-29 01:17:27,855 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:27,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-07-29 01:17:27,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:27,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:17:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:27,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:28,176 INFO L263 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2204#true} is VALID [2020-07-29 01:17:28,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {2204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2204#true} is VALID [2020-07-29 01:17:28,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {2204#true} assume true; {2204#true} is VALID [2020-07-29 01:17:28,177 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2204#true} {2204#true} #42#return; {2204#true} is VALID [2020-07-29 01:17:28,177 INFO L263 TraceCheckUtils]: 4: Hoare triple {2204#true} call #t~ret5 := main(); {2204#true} is VALID [2020-07-29 01:17:28,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {2204#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {2236#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:28,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {2236#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2236#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:28,179 INFO L280 TraceCheckUtils]: 7: Hoare triple {2236#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2236#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:28,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {2236#(<= main_~i~0 0)} havoc #t~nondet3; {2236#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:28,180 INFO L280 TraceCheckUtils]: 9: Hoare triple {2236#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,182 INFO L280 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {2210#(<= main_~i~0 1)} havoc #t~nondet3; {2210#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {2210#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {2211#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {2211#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {2211#(<= main_~i~0 2)} havoc #t~nondet3; {2211#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,185 INFO L280 TraceCheckUtils]: 17: Hoare triple {2211#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,186 INFO L280 TraceCheckUtils]: 18: Hoare triple {2212#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,186 INFO L280 TraceCheckUtils]: 19: Hoare triple {2212#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,187 INFO L280 TraceCheckUtils]: 20: Hoare triple {2212#(<= main_~i~0 3)} havoc #t~nondet3; {2212#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,187 INFO L280 TraceCheckUtils]: 21: Hoare triple {2212#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,188 INFO L280 TraceCheckUtils]: 22: Hoare triple {2213#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,188 INFO L280 TraceCheckUtils]: 23: Hoare triple {2213#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,189 INFO L280 TraceCheckUtils]: 24: Hoare triple {2213#(<= main_~i~0 4)} havoc #t~nondet3; {2213#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,190 INFO L280 TraceCheckUtils]: 25: Hoare triple {2213#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,190 INFO L280 TraceCheckUtils]: 26: Hoare triple {2214#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,191 INFO L280 TraceCheckUtils]: 27: Hoare triple {2214#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,192 INFO L280 TraceCheckUtils]: 28: Hoare triple {2214#(<= main_~i~0 5)} havoc #t~nondet3; {2214#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,192 INFO L280 TraceCheckUtils]: 29: Hoare triple {2214#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,193 INFO L280 TraceCheckUtils]: 30: Hoare triple {2215#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,193 INFO L280 TraceCheckUtils]: 31: Hoare triple {2215#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,194 INFO L280 TraceCheckUtils]: 32: Hoare triple {2215#(<= main_~i~0 6)} havoc #t~nondet3; {2215#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,194 INFO L280 TraceCheckUtils]: 33: Hoare triple {2215#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2216#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:28,195 INFO L280 TraceCheckUtils]: 34: Hoare triple {2216#(<= main_~i~0 7)} assume !(~i~0 < 10); {2205#false} is VALID [2020-07-29 01:17:28,195 INFO L280 TraceCheckUtils]: 35: Hoare triple {2205#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {2205#false} is VALID [2020-07-29 01:17:28,195 INFO L280 TraceCheckUtils]: 36: Hoare triple {2205#false} assume 97 == #t~mem4;havoc #t~mem4; {2205#false} is VALID [2020-07-29 01:17:28,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {2205#false} assume 0 == ~p~0.offset; {2205#false} is VALID [2020-07-29 01:17:28,196 INFO L280 TraceCheckUtils]: 38: Hoare triple {2205#false} assume !(~p~0.base < #StackHeapBarrier); {2205#false} is VALID [2020-07-29 01:17:28,197 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:28,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:28,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-07-29 01:17:28,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572460685] [2020-07-29 01:17:28,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-29 01:17:28,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:28,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:17:28,249 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:28,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-29 01:17:28,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:28,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:17:28,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:17:28,251 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 12 states. [2020-07-29 01:17:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,477 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-29 01:17:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:17:28,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-29 01:17:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:17:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2020-07-29 01:17:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:17:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2020-07-29 01:17:28,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2020-07-29 01:17:28,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:28,548 INFO L225 Difference]: With dead ends: 51 [2020-07-29 01:17:28,548 INFO L226 Difference]: Without dead ends: 51 [2020-07-29 01:17:28,548 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:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-29 01:17:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-07-29 01:17:28,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:28,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2020-07-29 01:17:28,551 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2020-07-29 01:17:28,552 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2020-07-29 01:17:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,553 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-29 01:17:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-29 01:17:28,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:28,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:28,554 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2020-07-29 01:17:28,554 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2020-07-29 01:17:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:28,555 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-29 01:17:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-29 01:17:28,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:28,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:28,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:28,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:17:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-29 01:17:28,557 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2020-07-29 01:17:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:28,558 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-29 01:17:28,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-29 01:17:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-29 01:17:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-29 01:17:28,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:28,558 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:28,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-29 01:17:28,774 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 4 times [2020-07-29 01:17:28,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:28,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099311389] [2020-07-29 01:17:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:28,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {2550#(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; {2536#true} is VALID [2020-07-29 01:17:28,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {2536#true} assume true; {2536#true} is VALID [2020-07-29 01:17:28,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2536#true} {2536#true} #42#return; {2536#true} is VALID [2020-07-29 01:17:28,962 INFO L263 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2550#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:28,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {2550#(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; {2536#true} is VALID [2020-07-29 01:17:28,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2020-07-29 01:17:28,962 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #42#return; {2536#true} is VALID [2020-07-29 01:17:28,963 INFO L263 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2020-07-29 01:17:28,963 INFO L280 TraceCheckUtils]: 5: Hoare triple {2536#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {2541#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:28,964 INFO L280 TraceCheckUtils]: 6: Hoare triple {2541#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2541#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:28,968 INFO L280 TraceCheckUtils]: 7: Hoare triple {2541#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2541#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:28,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {2541#(= 0 main_~i~0)} havoc #t~nondet3; {2541#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:28,972 INFO L280 TraceCheckUtils]: 9: Hoare triple {2541#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {2542#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,973 INFO L280 TraceCheckUtils]: 11: Hoare triple {2542#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,974 INFO L280 TraceCheckUtils]: 12: Hoare triple {2542#(<= main_~i~0 1)} havoc #t~nondet3; {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:28,976 INFO L280 TraceCheckUtils]: 13: Hoare triple {2542#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,976 INFO L280 TraceCheckUtils]: 14: Hoare triple {2543#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,977 INFO L280 TraceCheckUtils]: 15: Hoare triple {2543#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,977 INFO L280 TraceCheckUtils]: 16: Hoare triple {2543#(<= main_~i~0 2)} havoc #t~nondet3; {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:28,978 INFO L280 TraceCheckUtils]: 17: Hoare triple {2543#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,978 INFO L280 TraceCheckUtils]: 18: Hoare triple {2544#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {2544#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {2544#(<= main_~i~0 3)} havoc #t~nondet3; {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:28,979 INFO L280 TraceCheckUtils]: 21: Hoare triple {2544#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,980 INFO L280 TraceCheckUtils]: 22: Hoare triple {2545#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,980 INFO L280 TraceCheckUtils]: 23: Hoare triple {2545#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,980 INFO L280 TraceCheckUtils]: 24: Hoare triple {2545#(<= main_~i~0 4)} havoc #t~nondet3; {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:28,981 INFO L280 TraceCheckUtils]: 25: Hoare triple {2545#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,981 INFO L280 TraceCheckUtils]: 26: Hoare triple {2546#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,982 INFO L280 TraceCheckUtils]: 27: Hoare triple {2546#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,982 INFO L280 TraceCheckUtils]: 28: Hoare triple {2546#(<= main_~i~0 5)} havoc #t~nondet3; {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:28,983 INFO L280 TraceCheckUtils]: 29: Hoare triple {2546#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,983 INFO L280 TraceCheckUtils]: 30: Hoare triple {2547#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,983 INFO L280 TraceCheckUtils]: 31: Hoare triple {2547#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,984 INFO L280 TraceCheckUtils]: 32: Hoare triple {2547#(<= main_~i~0 6)} havoc #t~nondet3; {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:28,984 INFO L280 TraceCheckUtils]: 33: Hoare triple {2547#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:28,985 INFO L280 TraceCheckUtils]: 34: Hoare triple {2548#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:28,985 INFO L280 TraceCheckUtils]: 35: Hoare triple {2548#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:28,986 INFO L280 TraceCheckUtils]: 36: Hoare triple {2548#(<= main_~i~0 7)} havoc #t~nondet3; {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:28,986 INFO L280 TraceCheckUtils]: 37: Hoare triple {2548#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2549#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:28,987 INFO L280 TraceCheckUtils]: 38: Hoare triple {2549#(<= main_~i~0 8)} assume !(~i~0 < 10); {2537#false} is VALID [2020-07-29 01:17:28,987 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {2537#false} is VALID [2020-07-29 01:17:28,987 INFO L280 TraceCheckUtils]: 40: Hoare triple {2537#false} assume 97 == #t~mem4;havoc #t~mem4; {2537#false} is VALID [2020-07-29 01:17:28,987 INFO L280 TraceCheckUtils]: 41: Hoare triple {2537#false} assume 0 == ~p~0.offset; {2537#false} is VALID [2020-07-29 01:17:28,987 INFO L280 TraceCheckUtils]: 42: Hoare triple {2537#false} assume !(~p~0.base < #StackHeapBarrier); {2537#false} is VALID [2020-07-29 01:17:28,990 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:28,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099311389] [2020-07-29 01:17:28,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954840408] [2020-07-29 01:17:28,991 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:29,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:17:29,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:29,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:17:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:29,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:29,324 INFO L263 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2020-07-29 01:17:29,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {2536#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2536#true} is VALID [2020-07-29 01:17:29,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2020-07-29 01:17:29,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #42#return; {2536#true} is VALID [2020-07-29 01:17:29,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2020-07-29 01:17:29,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {2536#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {2569#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:29,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {2569#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2569#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:29,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {2569#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2569#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:29,327 INFO L280 TraceCheckUtils]: 8: Hoare triple {2569#(<= main_~i~0 0)} havoc #t~nondet3; {2569#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:29,328 INFO L280 TraceCheckUtils]: 9: Hoare triple {2569#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:29,328 INFO L280 TraceCheckUtils]: 10: Hoare triple {2542#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:29,329 INFO L280 TraceCheckUtils]: 11: Hoare triple {2542#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:29,329 INFO L280 TraceCheckUtils]: 12: Hoare triple {2542#(<= main_~i~0 1)} havoc #t~nondet3; {2542#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:29,330 INFO L280 TraceCheckUtils]: 13: Hoare triple {2542#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:29,330 INFO L280 TraceCheckUtils]: 14: Hoare triple {2543#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:29,331 INFO L280 TraceCheckUtils]: 15: Hoare triple {2543#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:29,331 INFO L280 TraceCheckUtils]: 16: Hoare triple {2543#(<= main_~i~0 2)} havoc #t~nondet3; {2543#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:29,332 INFO L280 TraceCheckUtils]: 17: Hoare triple {2543#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:29,333 INFO L280 TraceCheckUtils]: 18: Hoare triple {2544#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:29,333 INFO L280 TraceCheckUtils]: 19: Hoare triple {2544#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:29,334 INFO L280 TraceCheckUtils]: 20: Hoare triple {2544#(<= main_~i~0 3)} havoc #t~nondet3; {2544#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:29,334 INFO L280 TraceCheckUtils]: 21: Hoare triple {2544#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:29,335 INFO L280 TraceCheckUtils]: 22: Hoare triple {2545#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:29,335 INFO L280 TraceCheckUtils]: 23: Hoare triple {2545#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:29,336 INFO L280 TraceCheckUtils]: 24: Hoare triple {2545#(<= main_~i~0 4)} havoc #t~nondet3; {2545#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:29,336 INFO L280 TraceCheckUtils]: 25: Hoare triple {2545#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:29,337 INFO L280 TraceCheckUtils]: 26: Hoare triple {2546#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:29,337 INFO L280 TraceCheckUtils]: 27: Hoare triple {2546#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:29,338 INFO L280 TraceCheckUtils]: 28: Hoare triple {2546#(<= main_~i~0 5)} havoc #t~nondet3; {2546#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:29,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {2546#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:29,339 INFO L280 TraceCheckUtils]: 30: Hoare triple {2547#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:29,339 INFO L280 TraceCheckUtils]: 31: Hoare triple {2547#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:29,340 INFO L280 TraceCheckUtils]: 32: Hoare triple {2547#(<= main_~i~0 6)} havoc #t~nondet3; {2547#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:29,340 INFO L280 TraceCheckUtils]: 33: Hoare triple {2547#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:29,341 INFO L280 TraceCheckUtils]: 34: Hoare triple {2548#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:29,341 INFO L280 TraceCheckUtils]: 35: Hoare triple {2548#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:29,342 INFO L280 TraceCheckUtils]: 36: Hoare triple {2548#(<= main_~i~0 7)} havoc #t~nondet3; {2548#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:29,342 INFO L280 TraceCheckUtils]: 37: Hoare triple {2548#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2549#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:29,343 INFO L280 TraceCheckUtils]: 38: Hoare triple {2549#(<= main_~i~0 8)} assume !(~i~0 < 10); {2537#false} is VALID [2020-07-29 01:17:29,343 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {2537#false} is VALID [2020-07-29 01:17:29,343 INFO L280 TraceCheckUtils]: 40: Hoare triple {2537#false} assume 97 == #t~mem4;havoc #t~mem4; {2537#false} is VALID [2020-07-29 01:17:29,343 INFO L280 TraceCheckUtils]: 41: Hoare triple {2537#false} assume 0 == ~p~0.offset; {2537#false} is VALID [2020-07-29 01:17:29,343 INFO L280 TraceCheckUtils]: 42: Hoare triple {2537#false} assume !(~p~0.base < #StackHeapBarrier); {2537#false} is VALID [2020-07-29 01:17:29,346 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:29,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:29,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-07-29 01:17:29,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087885136] [2020-07-29 01:17:29,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-07-29 01:17:29,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:29,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:17:29,410 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:29,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:17:29,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:17:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:17:29,412 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 13 states. [2020-07-29 01:17:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,628 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-29 01:17:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 01:17:29,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-07-29 01:17:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:17:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2020-07-29 01:17:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:17:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2020-07-29 01:17:29,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2020-07-29 01:17:29,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:29,700 INFO L225 Difference]: With dead ends: 55 [2020-07-29 01:17:29,700 INFO L226 Difference]: Without dead ends: 55 [2020-07-29 01:17:29,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:17:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-29 01:17:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2020-07-29 01:17:29,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:29,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 52 states. [2020-07-29 01:17:29,704 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 52 states. [2020-07-29 01:17:29,704 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 52 states. [2020-07-29 01:17:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,705 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-29 01:17:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-29 01:17:29,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,706 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 55 states. [2020-07-29 01:17:29,706 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 55 states. [2020-07-29 01:17:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:29,708 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-29 01:17:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-29 01:17:29,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:29,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:29,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:29,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-29 01:17:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-07-29 01:17:29,710 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2020-07-29 01:17:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:29,710 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-07-29 01:17:29,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:17:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-07-29 01:17:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-29 01:17:29,711 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:29,711 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:29,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:29,925 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 5 times [2020-07-29 01:17:29,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:29,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162044494] [2020-07-29 01:17:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {2912#(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; {2897#true} is VALID [2020-07-29 01:17:30,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-29 01:17:30,086 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2897#true} {2897#true} #42#return; {2897#true} is VALID [2020-07-29 01:17:30,087 INFO L263 TraceCheckUtils]: 0: Hoare triple {2897#true} call ULTIMATE.init(); {2912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:30,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {2912#(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; {2897#true} is VALID [2020-07-29 01:17:30,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-29 01:17:30,088 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2897#true} {2897#true} #42#return; {2897#true} is VALID [2020-07-29 01:17:30,088 INFO L263 TraceCheckUtils]: 4: Hoare triple {2897#true} call #t~ret5 := main(); {2897#true} is VALID [2020-07-29 01:17:30,089 INFO L280 TraceCheckUtils]: 5: Hoare triple {2897#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {2902#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,089 INFO L280 TraceCheckUtils]: 6: Hoare triple {2902#(= 0 main_~i~0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2902#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,090 INFO L280 TraceCheckUtils]: 7: Hoare triple {2902#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2902#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,090 INFO L280 TraceCheckUtils]: 8: Hoare triple {2902#(= 0 main_~i~0)} havoc #t~nondet3; {2902#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:30,091 INFO L280 TraceCheckUtils]: 9: Hoare triple {2902#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,091 INFO L280 TraceCheckUtils]: 10: Hoare triple {2903#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,092 INFO L280 TraceCheckUtils]: 11: Hoare triple {2903#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,092 INFO L280 TraceCheckUtils]: 12: Hoare triple {2903#(<= main_~i~0 1)} havoc #t~nondet3; {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {2903#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,094 INFO L280 TraceCheckUtils]: 14: Hoare triple {2904#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,094 INFO L280 TraceCheckUtils]: 15: Hoare triple {2904#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,095 INFO L280 TraceCheckUtils]: 16: Hoare triple {2904#(<= main_~i~0 2)} havoc #t~nondet3; {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,095 INFO L280 TraceCheckUtils]: 17: Hoare triple {2904#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,096 INFO L280 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,096 INFO L280 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,097 INFO L280 TraceCheckUtils]: 20: Hoare triple {2905#(<= main_~i~0 3)} havoc #t~nondet3; {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,097 INFO L280 TraceCheckUtils]: 21: Hoare triple {2905#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,098 INFO L280 TraceCheckUtils]: 22: Hoare triple {2906#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,099 INFO L280 TraceCheckUtils]: 23: Hoare triple {2906#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,099 INFO L280 TraceCheckUtils]: 24: Hoare triple {2906#(<= main_~i~0 4)} havoc #t~nondet3; {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,100 INFO L280 TraceCheckUtils]: 25: Hoare triple {2906#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,100 INFO L280 TraceCheckUtils]: 26: Hoare triple {2907#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,101 INFO L280 TraceCheckUtils]: 27: Hoare triple {2907#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,101 INFO L280 TraceCheckUtils]: 28: Hoare triple {2907#(<= main_~i~0 5)} havoc #t~nondet3; {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,102 INFO L280 TraceCheckUtils]: 29: Hoare triple {2907#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,103 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,104 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,104 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#(<= main_~i~0 6)} havoc #t~nondet3; {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,105 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,105 INFO L280 TraceCheckUtils]: 34: Hoare triple {2909#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,106 INFO L280 TraceCheckUtils]: 35: Hoare triple {2909#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,106 INFO L280 TraceCheckUtils]: 36: Hoare triple {2909#(<= main_~i~0 7)} havoc #t~nondet3; {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,107 INFO L280 TraceCheckUtils]: 37: Hoare triple {2909#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,108 INFO L280 TraceCheckUtils]: 38: Hoare triple {2910#(<= main_~i~0 8)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,108 INFO L280 TraceCheckUtils]: 39: Hoare triple {2910#(<= main_~i~0 8)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,109 INFO L280 TraceCheckUtils]: 40: Hoare triple {2910#(<= main_~i~0 8)} havoc #t~nondet3; {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,110 INFO L280 TraceCheckUtils]: 41: Hoare triple {2910#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2911#(<= main_~i~0 9)} is VALID [2020-07-29 01:17:30,110 INFO L280 TraceCheckUtils]: 42: Hoare triple {2911#(<= main_~i~0 9)} assume !(~i~0 < 10); {2898#false} is VALID [2020-07-29 01:17:30,110 INFO L280 TraceCheckUtils]: 43: Hoare triple {2898#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {2898#false} is VALID [2020-07-29 01:17:30,111 INFO L280 TraceCheckUtils]: 44: Hoare triple {2898#false} assume 97 == #t~mem4;havoc #t~mem4; {2898#false} is VALID [2020-07-29 01:17:30,111 INFO L280 TraceCheckUtils]: 45: Hoare triple {2898#false} assume 0 == ~p~0.offset; {2898#false} is VALID [2020-07-29 01:17:30,111 INFO L280 TraceCheckUtils]: 46: Hoare triple {2898#false} assume !(~p~0.base < #StackHeapBarrier); {2898#false} is VALID [2020-07-29 01:17:30,114 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:30,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162044494] [2020-07-29 01:17:30,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810923925] [2020-07-29 01:17:30,115 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:30,200 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2020-07-29 01:17:30,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:30,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:17:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:30,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:30,483 INFO L263 TraceCheckUtils]: 0: Hoare triple {2897#true} call ULTIMATE.init(); {2897#true} is VALID [2020-07-29 01:17:30,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {2897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2897#true} is VALID [2020-07-29 01:17:30,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-29 01:17:30,484 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2897#true} {2897#true} #42#return; {2897#true} is VALID [2020-07-29 01:17:30,484 INFO L263 TraceCheckUtils]: 4: Hoare triple {2897#true} call #t~ret5 := main(); {2897#true} is VALID [2020-07-29 01:17:30,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {2897#true} call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnStack(10);~p~0.base, ~p~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {2931#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {2931#(<= main_~i~0 0)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2931#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {2931#(<= main_~i~0 0)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2931#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {2931#(<= main_~i~0 0)} havoc #t~nondet3; {2931#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:30,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {2931#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {2903#(<= main_~i~0 1)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {2903#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {2903#(<= main_~i~0 1)} havoc #t~nondet3; {2903#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:30,490 INFO L280 TraceCheckUtils]: 13: Hoare triple {2903#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {2904#(<= main_~i~0 2)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {2904#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,491 INFO L280 TraceCheckUtils]: 16: Hoare triple {2904#(<= main_~i~0 2)} havoc #t~nondet3; {2904#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:30,492 INFO L280 TraceCheckUtils]: 17: Hoare triple {2904#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~i~0 3)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {2905#(<= main_~i~0 3)} havoc #t~nondet3; {2905#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:30,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {2905#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,496 INFO L280 TraceCheckUtils]: 22: Hoare triple {2906#(<= main_~i~0 4)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,497 INFO L280 TraceCheckUtils]: 23: Hoare triple {2906#(<= main_~i~0 4)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,497 INFO L280 TraceCheckUtils]: 24: Hoare triple {2906#(<= main_~i~0 4)} havoc #t~nondet3; {2906#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:30,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {2906#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,499 INFO L280 TraceCheckUtils]: 26: Hoare triple {2907#(<= main_~i~0 5)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,499 INFO L280 TraceCheckUtils]: 27: Hoare triple {2907#(<= main_~i~0 5)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,500 INFO L280 TraceCheckUtils]: 28: Hoare triple {2907#(<= main_~i~0 5)} havoc #t~nondet3; {2907#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:30,501 INFO L280 TraceCheckUtils]: 29: Hoare triple {2907#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,502 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#(<= main_~i~0 6)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,502 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#(<= main_~i~0 6)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,503 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#(<= main_~i~0 6)} havoc #t~nondet3; {2908#(<= main_~i~0 6)} is VALID [2020-07-29 01:17:30,503 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,504 INFO L280 TraceCheckUtils]: 34: Hoare triple {2909#(<= main_~i~0 7)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,505 INFO L280 TraceCheckUtils]: 35: Hoare triple {2909#(<= main_~i~0 7)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,505 INFO L280 TraceCheckUtils]: 36: Hoare triple {2909#(<= main_~i~0 7)} havoc #t~nondet3; {2909#(<= main_~i~0 7)} is VALID [2020-07-29 01:17:30,506 INFO L280 TraceCheckUtils]: 37: Hoare triple {2909#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,506 INFO L280 TraceCheckUtils]: 38: Hoare triple {2910#(<= main_~i~0 8)} assume !!(~i~0 < 10);assume -128 <= #t~nondet3 && #t~nondet3 <= 127; {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,507 INFO L280 TraceCheckUtils]: 39: Hoare triple {2910#(<= main_~i~0 8)} SUMMARY for call write~int(#t~nondet3, ~p~0.base, ~p~0.offset + ~i~0, 1); srcloc: L10 {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,507 INFO L280 TraceCheckUtils]: 40: Hoare triple {2910#(<= main_~i~0 8)} havoc #t~nondet3; {2910#(<= main_~i~0 8)} is VALID [2020-07-29 01:17:30,508 INFO L280 TraceCheckUtils]: 41: Hoare triple {2910#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2911#(<= main_~i~0 9)} is VALID [2020-07-29 01:17:30,509 INFO L280 TraceCheckUtils]: 42: Hoare triple {2911#(<= main_~i~0 9)} assume !(~i~0 < 10); {2898#false} is VALID [2020-07-29 01:17:30,509 INFO L280 TraceCheckUtils]: 43: Hoare triple {2898#false} SUMMARY for call #t~mem4 := read~int(~p~0.base, 2 + ~p~0.offset, 1); srcloc: L9-4 {2898#false} is VALID [2020-07-29 01:17:30,509 INFO L280 TraceCheckUtils]: 44: Hoare triple {2898#false} assume 97 == #t~mem4;havoc #t~mem4; {2898#false} is VALID [2020-07-29 01:17:30,510 INFO L280 TraceCheckUtils]: 45: Hoare triple {2898#false} assume 0 == ~p~0.offset; {2898#false} is VALID [2020-07-29 01:17:30,510 INFO L280 TraceCheckUtils]: 46: Hoare triple {2898#false} assume !(~p~0.base < #StackHeapBarrier); {2898#false} is VALID [2020-07-29 01:17:30,515 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:30,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:30,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-07-29 01:17:30,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016012063] [2020-07-29 01:17:30,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2020-07-29 01:17:30,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:30,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:17:30,577 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:30,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-29 01:17:30,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:17:30,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:17:30,578 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 14 states. [2020-07-29 01:17:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,808 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-07-29 01:17:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 01:17:30,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2020-07-29 01:17:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:17:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2020-07-29 01:17:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:17:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2020-07-29 01:17:30,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2020-07-29 01:17:30,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:30,884 INFO L225 Difference]: With dead ends: 56 [2020-07-29 01:17:30,884 INFO L226 Difference]: Without dead ends: 56 [2020-07-29 01:17:30,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:17:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-29 01:17:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-29 01:17:30,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:30,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-29 01:17:30,888 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-29 01:17:30,888 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-29 01:17:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,890 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-07-29 01:17:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-07-29 01:17:30,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,891 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-29 01:17:30,891 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-29 01:17:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:30,892 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-07-29 01:17:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-07-29 01:17:30,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:30,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:30,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:30,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 01:17:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-07-29 01:17:30,895 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2020-07-29 01:17:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:30,895 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-07-29 01:17:30,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-29 01:17:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-07-29 01:17:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-29 01:17:30,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:30,896 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:31,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-29 01:17:31,109 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 01:17:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 6 times [2020-07-29 01:17:31,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:31,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709486049] [2020-07-29 01:17:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:31,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:31,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:31,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:17:31,193 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:17:31,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-29 01:17:31,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:17:31 BoogieIcfgContainer [2020-07-29 01:17:31,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:17:31,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:17:31,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:17:31,252 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:17:31,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:19" (3/4) ... [2020-07-29 01:17:31,255 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:17:31,316 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:17:31,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:17:31,319 INFO L168 Benchmark]: Toolchain (without parser) took 12571.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.5 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -83.1 MB). Peak memory consumption was 186.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:31,319 INFO L168 Benchmark]: CDTParser took 0.57 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:31,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.77 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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:31,320 INFO L168 Benchmark]: Boogie Preprocessor took 94.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -124.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:31,320 INFO L168 Benchmark]: RCFGBuilder took 395.01 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:31,321 INFO L168 Benchmark]: TraceAbstraction took 11771.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -11.4 MB). Peak memory consumption was 171.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:31,321 INFO L168 Benchmark]: Witness Printer took 64.76 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:31,323 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.57 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 234.77 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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 94.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -124.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 395.01 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11771.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -11.4 MB). Peak memory consumption was 171.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.76 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-1, alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-5, alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-6, alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-9, alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-10, alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L9] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L13] EXPR p[2] VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}, p[2]=97] [L13] COND TRUE p[2] == 'a' [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 238 SDtfs, 208 SDslu, 705 SDs, 0 SdLazy, 725 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, 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, 15 MinimizatonAttempts, 30 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 685 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 609 ConstructedInterpolants, 1 QuantifiedInterpolants, 62822 SizeOfPredicates, 12 NumberOfNonLiveVariables, 961 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 53/1124 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...