./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5a079682 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 17d20a29a9e9cc6560e9aa0daac36f5de29f992c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:02:58,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:02:58,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:02:58,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:02:58,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:02:58,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:02:58,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:02:58,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:02:58,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:02:58,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:02:58,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:02:58,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:02:58,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:02:58,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:02:58,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:02:58,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:02:58,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:02:58,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:02:58,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:02:58,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:02:58,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:02:58,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:02:58,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:02:58,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:02:58,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:02:58,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:02:58,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:02:58,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:02:58,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:02:58,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:02:58,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:02:58,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:02:58,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:02:58,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:02:58,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:02:58,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:02:58,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:02:58,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:02:58,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:02:58,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:02:58,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:02:58,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 11:02:58,315 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:02:58,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:02:58,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:02:58,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:02:58,320 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:02:58,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:02:58,320 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:02:58,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:02:58,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:02:58,321 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:02:58,321 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:02:58,321 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:02:58,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:02:58,322 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:02:58,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:02:58,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:02:58,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:02:58,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:02:58,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:02:58,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:02:58,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:02:58,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:02:58,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:02:58,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:02:58,324 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17d20a29a9e9cc6560e9aa0daac36f5de29f992c [2019-11-22 11:02:58,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:02:58,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:02:58,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:02:58,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:02:58,644 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:02:58,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-22 11:02:58,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49da65de/c18f5490344d43368053457a21499ac6/FLAG9fcebefdf [2019-11-22 11:02:59,141 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:02:59,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-22 11:02:59,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49da65de/c18f5490344d43368053457a21499ac6/FLAG9fcebefdf [2019-11-22 11:02:59,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b49da65de/c18f5490344d43368053457a21499ac6 [2019-11-22 11:02:59,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:02:59,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:02:59,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:02:59,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:02:59,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:02:59,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1750fb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59, skipping insertion in model container [2019-11-22 11:02:59,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:02:59,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:02:59,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:02:59,756 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:02:59,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:02:59,789 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:02:59,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59 WrapperNode [2019-11-22 11:02:59,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:02:59,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:02:59,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:02:59,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:02:59,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... [2019-11-22 11:02:59,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:02:59,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:02:59,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:02:59,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:02:59,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:02:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:02:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:02:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 11:02:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 11:02:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:02:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 11:02:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:02:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:02:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:02:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 11:02:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 11:02:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:02:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 11:02:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:02:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:02:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:02:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 11:02:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:02:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:02:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:02:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:03:00,319 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:03:00,319 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-22 11:03:00,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:00 BoogieIcfgContainer [2019-11-22 11:03:00,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:03:00,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:03:00,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:03:00,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:03:00,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:02:59" (1/3) ... [2019-11-22 11:03:00,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dfa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:03:00, skipping insertion in model container [2019-11-22 11:03:00,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:59" (2/3) ... [2019-11-22 11:03:00,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dfa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:03:00, skipping insertion in model container [2019-11-22 11:03:00,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:00" (3/3) ... [2019-11-22 11:03:00,328 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-11-22 11:03:00,338 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:03:00,345 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-22 11:03:00,357 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-22 11:03:00,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:03:00,377 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:03:00,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:03:00,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:03:00,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:03:00,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:03:00,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:03:00,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:03:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-22 11:03:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 11:03:00,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:00,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:00,406 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-11-22 11:03:00,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:00,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287167552] [2019-11-22 11:03:00,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:00,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287167552] [2019-11-22 11:03:00,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:00,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:03:00,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187391467] [2019-11-22 11:03:00,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:00,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:03:00,829 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-22 11:03:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:01,195 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-22 11:03:01,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:01,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-22 11:03:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:01,213 INFO L225 Difference]: With dead ends: 52 [2019-11-22 11:03:01,214 INFO L226 Difference]: Without dead ends: 49 [2019-11-22 11:03:01,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-22 11:03:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-22 11:03:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-22 11:03:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-22 11:03:01,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-11-22 11:03:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:01,282 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-22 11:03:01,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-22 11:03:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:03:01,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:01,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:01,286 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-11-22 11:03:01,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:01,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350159840] [2019-11-22 11:03:01,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:01,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350159840] [2019-11-22 11:03:01,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:01,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:03:01,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198594202] [2019-11-22 11:03:01,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:01,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:01,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:01,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:03:01,466 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-22 11:03:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:01,711 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-22 11:03:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:03:01,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-22 11:03:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:01,715 INFO L225 Difference]: With dead ends: 48 [2019-11-22 11:03:01,715 INFO L226 Difference]: Without dead ends: 48 [2019-11-22 11:03:01,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-22 11:03:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-22 11:03:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-22 11:03:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-22 11:03:01,731 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-11-22 11:03:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:01,732 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-22 11:03:01,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-22 11:03:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 11:03:01,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:01,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:01,736 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-11-22 11:03:01,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:01,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544393158] [2019-11-22 11:03:01,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:01,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544393158] [2019-11-22 11:03:01,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:01,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:03:01,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513245376] [2019-11-22 11:03:01,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:01,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:03:01,877 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-11-22 11:03:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:02,106 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-22 11:03:02,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:03:02,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-22 11:03:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:02,108 INFO L225 Difference]: With dead ends: 47 [2019-11-22 11:03:02,108 INFO L226 Difference]: Without dead ends: 47 [2019-11-22 11:03:02,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-22 11:03:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-22 11:03:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-22 11:03:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-22 11:03:02,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-22 11:03:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:02,123 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-22 11:03:02,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-22 11:03:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:03:02,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:02,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:02,125 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-11-22 11:03:02,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:02,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641931944] [2019-11-22 11:03:02,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:02,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641931944] [2019-11-22 11:03:02,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:02,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:03:02,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472729655] [2019-11-22 11:03:02,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:03:02,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:03:02,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:03:02,268 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-11-22 11:03:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:02,552 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-22 11:03:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:03:02,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 11:03:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:02,554 INFO L225 Difference]: With dead ends: 43 [2019-11-22 11:03:02,554 INFO L226 Difference]: Without dead ends: 43 [2019-11-22 11:03:02,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:03:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-22 11:03:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-22 11:03:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-22 11:03:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-22 11:03:02,562 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-11-22 11:03:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:02,562 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-22 11:03:02,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:03:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-22 11:03:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:03:02,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:02,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:02,564 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-11-22 11:03:02,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:02,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390320886] [2019-11-22 11:03:02,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:02,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390320886] [2019-11-22 11:03:02,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:02,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:03:02,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075114323] [2019-11-22 11:03:02,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:03:02,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:03:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:02,728 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-11-22 11:03:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:03,357 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-22 11:03:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:03:03,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-22 11:03:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:03,364 INFO L225 Difference]: With dead ends: 77 [2019-11-22 11:03:03,364 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 11:03:03,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:03:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 11:03:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-22 11:03:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 11:03:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-22 11:03:03,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-11-22 11:03:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:03,375 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-22 11:03:03,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:03:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-22 11:03:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 11:03:03,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:03,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:03,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-11-22 11:03:03,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:03,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976995232] [2019-11-22 11:03:03,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:03,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976995232] [2019-11-22 11:03:03,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:03,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:03,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557832590] [2019-11-22 11:03:03,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:03,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:03,487 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-11-22 11:03:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:03,709 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-22 11:03:03,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:03,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 11:03:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:03,712 INFO L225 Difference]: With dead ends: 60 [2019-11-22 11:03:03,712 INFO L226 Difference]: Without dead ends: 55 [2019-11-22 11:03:03,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-22 11:03:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-22 11:03:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 11:03:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-22 11:03:03,719 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-22 11:03:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:03,720 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-22 11:03:03,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-22 11:03:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 11:03:03,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:03,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:03,721 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-11-22 11:03:03,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:03,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597130669] [2019-11-22 11:03:03,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:03,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597130669] [2019-11-22 11:03:03,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:03,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 11:03:03,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611228798] [2019-11-22 11:03:03,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:03:03,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:03,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:03:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:03,870 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-11-22 11:03:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:04,367 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-22 11:03:04,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:03:04,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 11:03:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:04,369 INFO L225 Difference]: With dead ends: 68 [2019-11-22 11:03:04,369 INFO L226 Difference]: Without dead ends: 68 [2019-11-22 11:03:04,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:03:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-22 11:03:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-11-22 11:03:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 11:03:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-22 11:03:04,376 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-11-22 11:03:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:04,377 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-22 11:03:04,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:03:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-22 11:03:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 11:03:04,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:04,378 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:04,378 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-11-22 11:03:04,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:04,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362782368] [2019-11-22 11:03:04,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:04,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362782368] [2019-11-22 11:03:04,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508489540] [2019-11-22 11:03:04,531 INFO L94 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 [2019-11-22 11:03:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 11:03:04,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:04,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:04,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-22 11:03:04,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590727305] [2019-11-22 11:03:04,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-22 11:03:04,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-22 11:03:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:03:04,842 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-11-22 11:03:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:05,956 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-11-22 11:03:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-22 11:03:05,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-22 11:03:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:05,959 INFO L225 Difference]: With dead ends: 80 [2019-11-22 11:03:05,959 INFO L226 Difference]: Without dead ends: 80 [2019-11-22 11:03:05,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-11-22 11:03:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-22 11:03:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-22 11:03:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 11:03:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-22 11:03:05,969 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-11-22 11:03:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:05,970 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-22 11:03:05,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-22 11:03:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-22 11:03:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 11:03:05,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:05,972 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:06,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:06,187 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:06,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-11-22 11:03:06,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:06,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084859328] [2019-11-22 11:03:06,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:06,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084859328] [2019-11-22 11:03:06,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246078886] [2019-11-22 11:03:06,452 INFO L94 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 [2019-11-22 11:03:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 11:03:06,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:06,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:06,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-22 11:03:06,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149824781] [2019-11-22 11:03:06,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 11:03:06,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 11:03:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:03:06,999 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-11-22 11:03:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:11,694 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-22 11:03:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-22 11:03:11,695 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-22 11:03:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:11,698 INFO L225 Difference]: With dead ends: 110 [2019-11-22 11:03:11,698 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 11:03:11,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2019-11-22 11:03:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 11:03:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-11-22 11:03:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-22 11:03:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-22 11:03:11,727 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-11-22 11:03:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:11,729 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-22 11:03:11,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 11:03:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-22 11:03:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:03:11,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:11,731 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:11,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:11,934 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-11-22 11:03:11,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:11,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090253965] [2019-11-22 11:03:11,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 11:03:12,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090253965] [2019-11-22 11:03:12,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247108665] [2019-11-22 11:03:12,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-22 11:03:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:12,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:03:12,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:12,287 INFO L377 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 8 treesize of output 7 [2019-11-22 11:03:12,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 11:03:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:12,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:12,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 11:03:12,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638905268] [2019-11-22 11:03:12,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 11:03:12,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 11:03:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:03:12,691 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-11-22 11:03:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:14,409 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-11-22 11:03:14,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 11:03:14,409 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-22 11:03:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:14,411 INFO L225 Difference]: With dead ends: 115 [2019-11-22 11:03:14,411 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 11:03:14,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 11:03:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 11:03:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-11-22 11:03:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-22 11:03:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-22 11:03:14,421 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-11-22 11:03:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:14,422 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-22 11:03:14,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 11:03:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-22 11:03:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-22 11:03:14,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:14,424 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:14,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:14,628 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-11-22 11:03:14,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:14,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870918371] [2019-11-22 11:03:14,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:14,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870918371] [2019-11-22 11:03:14,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480835438] [2019-11-22 11:03:14,850 INFO L94 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 [2019-11-22 11:03:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:14,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:03:14,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:14,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2019-11-22 11:03:14,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:14,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:14,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:14,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-22 11:03:17,085 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-22 11:03:17,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-11-22 11:03:17,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:17,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:17,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:17,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-22 11:03:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:17,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:17,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-22 11:03:17,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568768655] [2019-11-22 11:03:17,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:03:17,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:03:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-22 11:03:17,208 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-11-22 11:03:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:17,377 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-22 11:03:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:03:17,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-22 11:03:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:17,379 INFO L225 Difference]: With dead ends: 83 [2019-11-22 11:03:17,379 INFO L226 Difference]: Without dead ends: 63 [2019-11-22 11:03:17,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-11-22 11:03:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-22 11:03:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-22 11:03:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 11:03:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-22 11:03:17,384 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-11-22 11:03:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:17,385 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-22 11:03:17,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:03:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-22 11:03:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 11:03:17,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:17,387 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:17,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:17,591 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-11-22 11:03:17,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:17,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783910869] [2019-11-22 11:03:17,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 11:03:17,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783910869] [2019-11-22 11:03:17,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634914370] [2019-11-22 11:03:17,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-22 11:03:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:03:17,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:17,826 INFO L377 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 8 treesize of output 7 [2019-11-22 11:03:17,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:17,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:17,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:17,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 11:03:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:18,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:18,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-22 11:03:18,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244461690] [2019-11-22 11:03:18,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 11:03:18,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:18,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 11:03:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:03:18,203 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-11-22 11:03:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:19,455 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-22 11:03:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-22 11:03:19,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-22 11:03:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:19,457 INFO L225 Difference]: With dead ends: 63 [2019-11-22 11:03:19,457 INFO L226 Difference]: Without dead ends: 63 [2019-11-22 11:03:19,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-11-22 11:03:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-22 11:03:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-22 11:03:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 11:03:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-22 11:03:19,462 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-11-22 11:03:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:19,463 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-22 11:03:19,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 11:03:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-22 11:03:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-22 11:03:19,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:19,465 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:19,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:19,675 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 11:03:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-11-22 11:03:19,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:19,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926833261] [2019-11-22 11:03:19,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-22 11:03:20,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926833261] [2019-11-22 11:03:20,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052804259] [2019-11-22 11:03:20,036 INFO L94 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 [2019-11-22 11:03:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:20,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-22 11:03:20,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:03:20,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:20,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-22 11:03:20,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512025090] [2019-11-22 11:03:20,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 11:03:20,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 11:03:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-22 11:03:20,497 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-22 11:03:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:22,760 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-22 11:03:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 11:03:22,760 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-22 11:03:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:22,761 INFO L225 Difference]: With dead ends: 66 [2019-11-22 11:03:22,761 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:03:22,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 11:03:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:03:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:03:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:03:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:03:22,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-22 11:03:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:22,764 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:03:22,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 11:03:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:03:22,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:03:22,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:22,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:03:22 BoogieIcfgContainer [2019-11-22 11:03:22,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:03:22,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:03:22,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:03:22,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:03:22,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:03:00" (3/4) ... [2019-11-22 11:03:22,978 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:03:22,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:03:22,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:03:22,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 11:03:22,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 11:03:22,984 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 11:03:22,990 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-22 11:03:22,990 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 11:03:22,990 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 11:03:22,991 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:03:23,043 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:03:23,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:03:23,046 INFO L168 Benchmark]: Toolchain (without parser) took 23551.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -232.5 MB). Peak memory consumption was 111.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:23,046 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:03:23,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.57 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:23,048 INFO L168 Benchmark]: Boogie Preprocessor took 93.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:23,048 INFO L168 Benchmark]: RCFGBuilder took 435.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:23,049 INFO L168 Benchmark]: TraceAbstraction took 22651.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.3 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:23,050 INFO L168 Benchmark]: Witness Printer took 70.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:03:23,053 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.57 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22651.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.3 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. * Witness Printer took 70.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 12 error locations. Result: SAFE, OverallTime: 22.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1965 SDslu, 712 SDs, 0 SdLazy, 4878 SolverSat, 989 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 247 SyntacticMatches, 11 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 32 QuantifiedInterpolants, 129907 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1012 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 49/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...