./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 7c71bc25 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-7c71bc2 [2019-11-25 13:35:17,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:35:17,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:35:17,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:35:17,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:35:17,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:35:17,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:35:17,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:35:17,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:35:17,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:35:17,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:35:17,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:35:17,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:35:17,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:35:17,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:35:17,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:35:17,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:35:17,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:35:17,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:35:17,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:35:17,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:35:17,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:35:17,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:35:17,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:35:17,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:35:17,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:35:17,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:35:17,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:35:17,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:35:17,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:35:17,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:35:17,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:35:17,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:35:17,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:35:17,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:35:17,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:35:17,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:35:17,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:35:17,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:35:17,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:35:17,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:35:17,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 13:35:17,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:35:17,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:35:17,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:35:17,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:35:17,819 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:35:17,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:35:17,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:35:17,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:35:17,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:35:17,820 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:35:17,821 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:35:17,821 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:35:17,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:35:17,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:35:17,822 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:35:17,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:35:17,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:35:17,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:35:17,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:35:17,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:35:17,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:35:17,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:35:17,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:35:17,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:35:17,824 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-25 13:35:18,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:35:18,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:35:18,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:35:18,154 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:35:18,156 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:35:18,157 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-25 13:35:18,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b28d4cab/24da964e461c471f9ed3b10294dc400b/FLAGd7a5384a3 [2019-11-25 13:35:18,682 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:35:18,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-11-25 13:35:18,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b28d4cab/24da964e461c471f9ed3b10294dc400b/FLAGd7a5384a3 [2019-11-25 13:35:19,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b28d4cab/24da964e461c471f9ed3b10294dc400b [2019-11-25 13:35:19,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:35:19,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:35:19,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:35:19,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:35:19,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:35:19,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d888c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19, skipping insertion in model container [2019-11-25 13:35:19,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:35:19,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:35:19,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:35:19,317 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:35:19,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:35:19,386 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:35:19,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19 WrapperNode [2019-11-25 13:35:19,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:35:19,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:35:19,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:35:19,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:35:19,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (1/1) ... [2019-11-25 13:35:19,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:35:19,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:35:19,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:35:19,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:35:19,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (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-25 13:35:19,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:35:19,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:35:19,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 13:35:19,594 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-25 13:35:19,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:35:19,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:35:19,594 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:35:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:35:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 13:35:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 13:35:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 13:35:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:35:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-25 13:35:19,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 13:35:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:35:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:35:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:35:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:35:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:35:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:35:19,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 13:35:19,991 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:35:19,991 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-25 13:35:19,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:35:19 BoogieIcfgContainer [2019-11-25 13:35:19,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:35:19,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:35:19,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:35:19,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:35:19,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:35:19" (1/3) ... [2019-11-25 13:35:19,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1064db24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:35:19, skipping insertion in model container [2019-11-25 13:35:19,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:35:19" (2/3) ... [2019-11-25 13:35:19,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1064db24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:35:19, skipping insertion in model container [2019-11-25 13:35:19,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:35:19" (3/3) ... [2019-11-25 13:35:20,001 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-11-25 13:35:20,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:35:20,018 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-11-25 13:35:20,029 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-25 13:35:20,050 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:35:20,050 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:35:20,050 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:35:20,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:35:20,051 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:35:20,051 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:35:20,051 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:35:20,051 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:35:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-25 13:35:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 13:35:20,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:20,083 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-25 13:35:20,083 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-25 13:35:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-11-25 13:35:20,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:20,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758285030] [2019-11-25 13:35:20,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:20,403 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-25 13:35:20,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758285030] [2019-11-25 13:35:20,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:20,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 13:35:20,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997422682] [2019-11-25 13:35:20,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:35:20,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:20,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:35:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:35:20,428 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-25 13:35:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:20,824 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-25 13:35:20,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:35:20,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-25 13:35:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:20,837 INFO L225 Difference]: With dead ends: 52 [2019-11-25 13:35:20,837 INFO L226 Difference]: Without dead ends: 49 [2019-11-25 13:35:20,840 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-25 13:35:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-25 13:35:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-25 13:35:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-25 13:35:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-25 13:35:20,896 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-11-25 13:35:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:20,898 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-25 13:35:20,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:35:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-25 13:35:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 13:35:20,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:20,901 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-25 13:35:20,902 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-25 13:35:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-11-25 13:35:20,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:20,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704452424] [2019-11-25 13:35:20,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,078 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-25 13:35:21,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704452424] [2019-11-25 13:35:21,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:21,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 13:35:21,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176053982] [2019-11-25 13:35:21,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:35:21,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:35:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:35:21,083 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-11-25 13:35:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:21,348 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-25 13:35:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:35:21,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-25 13:35:21,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:21,353 INFO L225 Difference]: With dead ends: 48 [2019-11-25 13:35:21,353 INFO L226 Difference]: Without dead ends: 48 [2019-11-25 13:35:21,355 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-25 13:35:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-25 13:35:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-25 13:35:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-25 13:35:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-25 13:35:21,374 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-11-25 13:35:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:21,375 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-25 13:35:21,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:35:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-25 13:35:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 13:35:21,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:21,379 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-25 13:35:21,380 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-25 13:35:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-11-25 13:35:21,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:21,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156257168] [2019-11-25 13:35:21,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,537 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-25 13:35:21,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156257168] [2019-11-25 13:35:21,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:21,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 13:35:21,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076035646] [2019-11-25 13:35:21,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:35:21,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:21,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:35:21,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:35:21,541 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-11-25 13:35:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:21,769 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-25 13:35:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:35:21,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-25 13:35:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:21,771 INFO L225 Difference]: With dead ends: 47 [2019-11-25 13:35:21,771 INFO L226 Difference]: Without dead ends: 47 [2019-11-25 13:35:21,772 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-25 13:35:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-25 13:35:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-25 13:35:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 13:35:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-25 13:35:21,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-11-25 13:35:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:21,787 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-25 13:35:21,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:35:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-25 13:35:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 13:35:21,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:21,790 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-25 13:35:21,791 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-25 13:35:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-11-25 13:35:21,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:21,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209400455] [2019-11-25 13:35:21,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:21,930 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-25 13:35:21,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209400455] [2019-11-25 13:35:21,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:21,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 13:35:21,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600995752] [2019-11-25 13:35:21,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:35:21,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:35:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:35:21,932 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-11-25 13:35:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:22,204 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-25 13:35:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:35:22,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-25 13:35:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:22,207 INFO L225 Difference]: With dead ends: 43 [2019-11-25 13:35:22,207 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 13:35:22,207 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-25 13:35:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 13:35:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-25 13:35:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 13:35:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-25 13:35:22,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-11-25 13:35:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:22,214 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-25 13:35:22,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:35:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-25 13:35:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 13:35:22,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:22,216 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-25 13:35:22,216 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-25 13:35:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-11-25 13:35:22,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:22,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048515238] [2019-11-25 13:35:22,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:22,356 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-25 13:35:22,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048515238] [2019-11-25 13:35:22,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:22,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 13:35:22,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212265375] [2019-11-25 13:35:22,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 13:35:22,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 13:35:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:35:22,360 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-11-25 13:35:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:22,936 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-25 13:35:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 13:35:22,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-25 13:35:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:22,940 INFO L225 Difference]: With dead ends: 77 [2019-11-25 13:35:22,940 INFO L226 Difference]: Without dead ends: 77 [2019-11-25 13:35:22,941 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-25 13:35:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-25 13:35:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-25 13:35:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 13:35:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-25 13:35:22,951 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-11-25 13:35:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:22,952 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-25 13:35:22,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 13:35:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-25 13:35:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 13:35:22,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:22,953 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-25 13:35:22,954 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-25 13:35:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-11-25 13:35:22,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:22,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467236451] [2019-11-25 13:35:22,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,063 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-25 13:35:23,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467236451] [2019-11-25 13:35:23,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:23,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 13:35:23,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491550851] [2019-11-25 13:35:23,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 13:35:23,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 13:35:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:35:23,066 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-11-25 13:35:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:23,280 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-25 13:35:23,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:35:23,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-25 13:35:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:23,281 INFO L225 Difference]: With dead ends: 60 [2019-11-25 13:35:23,281 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 13:35:23,282 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-25 13:35:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 13:35:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-25 13:35:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 13:35:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-11-25 13:35:23,289 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-11-25 13:35:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:23,289 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-11-25 13:35:23,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 13:35:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-11-25 13:35:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:35:23,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:23,291 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-25 13:35:23,291 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-25 13:35:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-11-25 13:35:23,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:23,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711548056] [2019-11-25 13:35:23,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:23,477 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-25 13:35:23,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711548056] [2019-11-25 13:35:23,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:35:23,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 13:35:23,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190469732] [2019-11-25 13:35:23,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:35:23,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:35:23,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:35:23,480 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-11-25 13:35:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:23,958 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-11-25 13:35:23,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:35:23,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-25 13:35:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:23,961 INFO L225 Difference]: With dead ends: 68 [2019-11-25 13:35:23,961 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 13:35:23,961 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-25 13:35:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 13:35:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-11-25 13:35:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 13:35:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-11-25 13:35:23,969 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-11-25 13:35:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:23,969 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-11-25 13:35:23,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:35:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-11-25 13:35:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 13:35:23,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:23,971 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-25 13:35:23,972 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-25 13:35:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-11-25 13:35:23,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:23,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942605127] [2019-11-25 13:35:23,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:24,123 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-25 13:35:24,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942605127] [2019-11-25 13:35:24,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422096081] [2019-11-25 13:35:24,124 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-25 13:35:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:24,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:35:24,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:35:24,412 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-25 13:35:24,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:35:24,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-25 13:35:24,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898824581] [2019-11-25 13:35:24,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:35:24,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:24,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:35:24,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:35:24,414 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-11-25 13:35:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:25,681 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-11-25 13:35:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-25 13:35:25,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-25 13:35:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:25,684 INFO L225 Difference]: With dead ends: 80 [2019-11-25 13:35:25,684 INFO L226 Difference]: Without dead ends: 80 [2019-11-25 13:35:25,685 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-25 13:35:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-25 13:35:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-25 13:35:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 13:35:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-25 13:35:25,694 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-11-25 13:35:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:25,694 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-25 13:35:25,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:35:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-11-25 13:35:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:35:25,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:25,696 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-25 13:35:25,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 13:35:25,899 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-25 13:35:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-11-25 13:35:25,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:25,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647649740] [2019-11-25 13:35:25,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:26,170 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-25 13:35:26,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647649740] [2019-11-25 13:35:26,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745243175] [2019-11-25 13:35:26,171 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-25 13:35:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:26,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 13:35:26,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:35:26,688 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-25 13:35:26,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:35:26,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-25 13:35:26,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747645345] [2019-11-25 13:35:26,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-25 13:35:26,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-25 13:35:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:35:26,691 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-11-25 13:35:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:31,525 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-11-25 13:35:31,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-25 13:35:31,526 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-25 13:35:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:31,529 INFO L225 Difference]: With dead ends: 110 [2019-11-25 13:35:31,529 INFO L226 Difference]: Without dead ends: 108 [2019-11-25 13:35:31,533 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-25 13:35:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-25 13:35:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-11-25 13:35:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 13:35:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-25 13:35:31,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-11-25 13:35:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:31,544 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-25 13:35:31,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-25 13:35:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-11-25 13:35:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 13:35:31,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:31,546 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-25 13:35:31,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 13:35:31,755 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-25 13:35:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-11-25 13:35:31,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:31,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266530938] [2019-11-25 13:35:31,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:32,006 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-25 13:35:32,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266530938] [2019-11-25 13:35:32,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231567955] [2019-11-25 13:35:32,010 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-25 13:35:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:32,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 13:35:32,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:35:32,161 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-25 13:35:32,162 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:35:32,168 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:35:32,169 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:35:32,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 13:35:32,587 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-25 13:35:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:35:32,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-25 13:35:32,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928815664] [2019-11-25 13:35:32,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 13:35:32,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 13:35:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 13:35:32,590 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-11-25 13:35:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:34,422 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-11-25 13:35:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 13:35:34,422 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-25 13:35:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:34,424 INFO L225 Difference]: With dead ends: 115 [2019-11-25 13:35:34,425 INFO L226 Difference]: Without dead ends: 115 [2019-11-25 13:35:34,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 13:35:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-25 13:35:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-11-25 13:35:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 13:35:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-11-25 13:35:34,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-11-25 13:35:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:34,435 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-11-25 13:35:34,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 13:35:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-11-25 13:35:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:35:34,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:34,437 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-25 13:35:34,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 13:35:34,641 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-25 13:35:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-11-25 13:35:34,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:34,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523706471] [2019-11-25 13:35:34,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:34,879 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-25 13:35:34,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523706471] [2019-11-25 13:35:34,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155200784] [2019-11-25 13:35:34,879 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-25 13:35:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:34,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:35:34,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:35:34,935 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-25 13:35:34,936 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:35:34,938 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:35:34,939 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:35:34,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-25 13:35:37,083 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-25 13:35:37,157 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-25 13:35:37,158 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:35:37,161 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:35:37,162 INFO L508 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-25 13:35:37,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-25 13:35:37,189 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-25 13:35:37,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 13:35:37,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-25 13:35:37,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786024287] [2019-11-25 13:35:37,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:35:37,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:35:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-25 13:35:37,191 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-11-25 13:35:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:37,343 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-25 13:35:37,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 13:35:37,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-25 13:35:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:37,345 INFO L225 Difference]: With dead ends: 83 [2019-11-25 13:35:37,345 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 13:35:37,346 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-25 13:35:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 13:35:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-25 13:35:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 13:35:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-25 13:35:37,350 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-11-25 13:35:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:37,351 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-25 13:35:37,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:35:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-25 13:35:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:35:37,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:37,352 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-25 13:35:37,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 13:35:37,557 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-25 13:35:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-11-25 13:35:37,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:37,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419945967] [2019-11-25 13:35:37,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:37,716 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-25 13:35:37,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419945967] [2019-11-25 13:35:37,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016457657] [2019-11-25 13:35:37,717 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-25 13:35:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:37,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 13:35:37,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:35:37,783 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-25 13:35:37,783 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:35:37,804 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:35:37,805 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:35:37,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 13:35:38,194 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-25 13:35:38,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:35:38,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-25 13:35:38,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962900214] [2019-11-25 13:35:38,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 13:35:38,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 13:35:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-25 13:35:38,199 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-11-25 13:35:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:39,398 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-25 13:35:39,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-25 13:35:39,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-25 13:35:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:39,400 INFO L225 Difference]: With dead ends: 63 [2019-11-25 13:35:39,400 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 13:35:39,401 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-25 13:35:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 13:35:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-25 13:35:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 13:35:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-25 13:35:39,405 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-11-25 13:35:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:39,405 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-25 13:35:39,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 13:35:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-25 13:35:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 13:35:39,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:35:39,408 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-25 13:35:39,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 13:35:39,612 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-25 13:35:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:35:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-11-25 13:35:39,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 13:35:39,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954102984] [2019-11-25 13:35:39,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 13:35:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:40,043 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-25 13:35:40,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954102984] [2019-11-25 13:35:40,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553878170] [2019-11-25 13:35:40,044 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-25 13:35:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:35:40,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-25 13:35:40,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:35:40,557 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-25 13:35:40,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:35:40,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-25 13:35:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637117408] [2019-11-25 13:35:40,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 13:35:40,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 13:35:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 13:35:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-25 13:35:40,560 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-25 13:35:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:35:42,760 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-25 13:35:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-25 13:35:42,760 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-25 13:35:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:35:42,761 INFO L225 Difference]: With dead ends: 66 [2019-11-25 13:35:42,761 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 13:35:42,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-25 13:35:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 13:35:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 13:35:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 13:35:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 13:35:42,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-25 13:35:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:35:42,763 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 13:35:42,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 13:35:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 13:35:42,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 13:35:42,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 13:35:42,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 01:35:42 BoogieIcfgContainer [2019-11-25 13:35:42,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 13:35:42,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 13:35:42,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 13:35:42,970 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 13:35:42,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:35:19" (3/4) ... [2019-11-25 13:35:42,974 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 13:35:42,979 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 13:35:42,979 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 13:35:42,979 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 13:35:42,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-25 13:35:42,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 13:35:42,986 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 13:35:42,986 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 13:35:42,986 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 13:35:42,987 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 13:35:43,036 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 13:35:43,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 13:35:43,038 INFO L168 Benchmark]: Toolchain (without parser) took 23972.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 154.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:35:43,039 INFO L168 Benchmark]: CDTParser took 0.32 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-25 13:35:43,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:35:43,040 INFO L168 Benchmark]: Boogie Preprocessor took 132.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:35:43,041 INFO L168 Benchmark]: RCFGBuilder took 473.07 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.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:35:43,041 INFO L168 Benchmark]: TraceAbstraction took 22975.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -37.9 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. [2019-11-25 13:35:43,042 INFO L168 Benchmark]: Witness Printer took 66.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:35:43,045 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.32 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 320.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 473.07 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.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22975.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -37.9 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. * Witness Printer took 66.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. 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.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1965 SDslu, 712 SDs, 0 SdLazy, 4878 SolverSat, 989 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 247 SyntacticMatches, 11 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 11.0s 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.4s SatisfiabilityAnalysisTime, 6.5s 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...