./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f 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/lcp.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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:59:27,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:59:27,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:59:27,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:59:27,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:59:27,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:59:27,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:59:27,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:59:27,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:59:27,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:59:27,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:59:27,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:59:27,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:59:27,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:59:27,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:59:27,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:59:27,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:59:27,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:59:27,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:59:27,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:59:27,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:59:27,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:59:27,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:59:27,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:59:27,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:59:27,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:59:27,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:59:27,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:59:27,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:59:27,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:59:27,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:59:27,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:59:27,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:59:27,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:59:27,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:59:27,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:59:27,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:59:27,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:59:27,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:59:27,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:59:27,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:59:27,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:59:27,772 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:59:27,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:59:27,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:59:27,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:59:27,780 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:59:27,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:59:27,781 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:59:27,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:59:27,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:59:27,783 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:59:27,784 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:59:27,784 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:59:27,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:59:27,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:59:27,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:59:27,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:59:27,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:59:27,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:59:27,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:59:27,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:27,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:59:27,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:59:27,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:59:27,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:59:27,791 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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-11-22 13:59:28,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:59:28,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:59:28,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:59:28,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:59:28,148 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:59:28,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2019-11-22 13:59:28,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5aae1693/aae4d6fb684f4dd288790b74858df9ac/FLAG6cb093fbf [2019-11-22 13:59:28,634 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:59:28,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2019-11-22 13:59:28,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5aae1693/aae4d6fb684f4dd288790b74858df9ac/FLAG6cb093fbf [2019-11-22 13:59:29,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5aae1693/aae4d6fb684f4dd288790b74858df9ac [2019-11-22 13:59:29,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:59:29,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:59:29,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:29,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:59:29,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:59:29,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574f5a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29, skipping insertion in model container [2019-11-22 13:59:29,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:59:29,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:59:29,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:29,313 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:59:29,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:29,407 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:59:29,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29 WrapperNode [2019-11-22 13:59:29,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:29,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:59:29,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:59:29,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:59:29,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... [2019-11-22 13:59:29,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:59:29,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:59:29,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:59:29,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:59:29,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:29,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:59:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:59:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 13:59:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-11-22 13:59:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-22 13:59:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:59:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 13:59:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:59:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:59:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:59:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 13:59:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:59:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 13:59:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-11-22 13:59:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:59:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-22 13:59:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:59:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:59:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 13:59:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:59:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:59:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:59:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:59:29,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:59:29,936 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 13:59:29,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:29 BoogieIcfgContainer [2019-11-22 13:59:29,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:59:29,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:59:29,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:59:29,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:59:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:59:29" (1/3) ... [2019-11-22 13:59:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecdc3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:29, skipping insertion in model container [2019-11-22 13:59:29,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:29" (2/3) ... [2019-11-22 13:59:29,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecdc3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:29, skipping insertion in model container [2019-11-22 13:59:29,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:29" (3/3) ... [2019-11-22 13:59:29,946 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-11-22 13:59:29,956 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:59:29,964 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-22 13:59:29,976 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-22 13:59:29,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:59:29,995 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:59:29,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:59:29,995 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:59:29,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:59:29,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:59:29,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:59:29,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:59:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-22 13:59:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 13:59:30,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:30,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:30,023 INFO L410 AbstractCegarLoop]: === Iteration 1 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-11-22 13:59:30,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:30,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846485377] [2019-11-22 13:59:30,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:30,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846485377] [2019-11-22 13:59:30,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:30,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:30,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078958136] [2019-11-22 13:59:30,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:30,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:30,370 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-11-22 13:59:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:30,851 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-22 13:59:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:59:30,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-22 13:59:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:30,868 INFO L225 Difference]: With dead ends: 60 [2019-11-22 13:59:30,869 INFO L226 Difference]: Without dead ends: 57 [2019-11-22 13:59:30,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:59:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-22 13:59:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-22 13:59:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-22 13:59:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-22 13:59:30,938 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-11-22 13:59:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:30,940 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-22 13:59:30,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-22 13:59:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 13:59:30,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:30,943 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:30,944 INFO L410 AbstractCegarLoop]: === Iteration 2 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-11-22 13:59:30,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:30,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127165273] [2019-11-22 13:59:30,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:31,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127165273] [2019-11-22 13:59:31,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:31,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 13:59:31,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558314849] [2019-11-22 13:59:31,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:59:31,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:59:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:59:31,256 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-11-22 13:59:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:31,930 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-22 13:59:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 13:59:31,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-22 13:59:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:31,935 INFO L225 Difference]: With dead ends: 70 [2019-11-22 13:59:31,936 INFO L226 Difference]: Without dead ends: 70 [2019-11-22 13:59:31,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:59:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-22 13:59:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-22 13:59:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-22 13:59:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-22 13:59:31,947 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-22 13:59:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:31,947 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-22 13:59:31,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:59:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-22 13:59:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 13:59:31,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:31,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:31,949 INFO L410 AbstractCegarLoop]: === Iteration 3 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-11-22 13:59:31,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:31,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278916126] [2019-11-22 13:59:31,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:32,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278916126] [2019-11-22 13:59:32,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:32,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 13:59:32,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190837886] [2019-11-22 13:59:32,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:59:32,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:59:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:59:32,205 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-11-22 13:59:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:32,807 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-22 13:59:32,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 13:59:32,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 13:59:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:32,811 INFO L225 Difference]: With dead ends: 69 [2019-11-22 13:59:32,813 INFO L226 Difference]: Without dead ends: 69 [2019-11-22 13:59:32,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:59:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-22 13:59:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-22 13:59:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 13:59:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-22 13:59:32,832 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-11-22 13:59:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:32,833 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-22 13:59:32,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:59:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-22 13:59:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:59:32,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:32,835 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:32,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-11-22 13:59:32,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:32,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138993914] [2019-11-22 13:59:32,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:32,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138993914] [2019-11-22 13:59:32,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:32,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:32,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403405007] [2019-11-22 13:59:32,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:59:32,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:32,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:59:32,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:59:32,930 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-22 13:59:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:33,087 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-22 13:59:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:59:33,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 13:59:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:33,089 INFO L225 Difference]: With dead ends: 61 [2019-11-22 13:59:33,089 INFO L226 Difference]: Without dead ends: 61 [2019-11-22 13:59:33,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-22 13:59:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-22 13:59:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 13:59:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-22 13:59:33,096 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-11-22 13:59:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:33,097 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-22 13:59:33,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:59:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-22 13:59:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:59:33,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:33,098 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:33,099 INFO L410 AbstractCegarLoop]: === Iteration 5 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-11-22 13:59:33,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:33,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943449236] [2019-11-22 13:59:33,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:33,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943449236] [2019-11-22 13:59:33,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790742143] [2019-11-22 13:59:33,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:33,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-22 13:59:33,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:33,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:33,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:33,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:33,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:33,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:33,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:33,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-22 13:59:33,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537609822] [2019-11-22 13:59:33,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 13:59:33,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 13:59:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-22 13:59:33,885 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-11-22 13:59:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:34,750 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-22 13:59:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 13:59:34,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-22 13:59:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:34,752 INFO L225 Difference]: With dead ends: 69 [2019-11-22 13:59:34,752 INFO L226 Difference]: Without dead ends: 69 [2019-11-22 13:59:34,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-22 13:59:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-22 13:59:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-22 13:59:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 13:59:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-22 13:59:34,760 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-11-22 13:59:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:34,760 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-22 13:59:34,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 13:59:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-22 13:59:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:59:34,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:34,762 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, 1] [2019-11-22 13:59:34,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:34,966 INFO L410 AbstractCegarLoop]: === Iteration 6 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-11-22 13:59:34,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:34,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205413980] [2019-11-22 13:59:34,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:35,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205413980] [2019-11-22 13:59:35,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:35,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-22 13:59:35,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863584878] [2019-11-22 13:59:35,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 13:59:35,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 13:59:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:59:35,058 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-11-22 13:59:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:35,388 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-22 13:59:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:59:35,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-22 13:59:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:35,390 INFO L225 Difference]: With dead ends: 69 [2019-11-22 13:59:35,390 INFO L226 Difference]: Without dead ends: 62 [2019-11-22 13:59:35,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:59:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-22 13:59:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-22 13:59:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 13:59:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-22 13:59:35,396 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-11-22 13:59:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:35,397 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-22 13:59:35,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 13:59:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-22 13:59:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:59:35,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:35,398 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:35,398 INFO L410 AbstractCegarLoop]: === Iteration 7 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-11-22 13:59:35,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:35,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312796076] [2019-11-22 13:59:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:35,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312796076] [2019-11-22 13:59:35,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081557857] [2019-11-22 13:59:35,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:35,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-22 13:59:35,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:35,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:35,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:35,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:35,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:35,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:35,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-22 13:59:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811864490] [2019-11-22 13:59:35,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 13:59:35,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 13:59:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-22 13:59:35,887 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-11-22 13:59:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:36,885 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-22 13:59:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 13:59:36,886 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-22 13:59:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:36,887 INFO L225 Difference]: With dead ends: 64 [2019-11-22 13:59:36,888 INFO L226 Difference]: Without dead ends: 64 [2019-11-22 13:59:36,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-11-22 13:59:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-22 13:59:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-22 13:59:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 13:59:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-22 13:59:36,896 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-11-22 13:59:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:36,896 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-22 13:59:36,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 13:59:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-22 13:59:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-22 13:59:36,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:36,897 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] [2019-11-22 13:59:37,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:37,101 INFO L410 AbstractCegarLoop]: === Iteration 8 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-11-22 13:59:37,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:37,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479902403] [2019-11-22 13:59:37,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:59:37,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479902403] [2019-11-22 13:59:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:37,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:37,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040510353] [2019-11-22 13:59:37,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:37,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:37,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:37,181 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-11-22 13:59:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:37,465 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-22 13:59:37,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 13:59:37,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-22 13:59:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:37,466 INFO L225 Difference]: With dead ends: 57 [2019-11-22 13:59:37,466 INFO L226 Difference]: Without dead ends: 57 [2019-11-22 13:59:37,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:59:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-22 13:59:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-22 13:59:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-22 13:59:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-22 13:59:37,472 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-11-22 13:59:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:37,472 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-22 13:59:37,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-22 13:59:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-22 13:59:37,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:37,473 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] [2019-11-22 13:59:37,474 INFO L410 AbstractCegarLoop]: === Iteration 9 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-11-22 13:59:37,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:37,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479095922] [2019-11-22 13:59:37,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:37,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479095922] [2019-11-22 13:59:37,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989141380] [2019-11-22 13:59:37,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:37,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:59:37,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:37,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:37,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:37,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:37,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:37,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:37,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:37,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:40,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:40,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-22 13:59:40,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971994338] [2019-11-22 13:59:40,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-22 13:59:40,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-22 13:59:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-22 13:59:40,258 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-11-22 13:59:43,459 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-22 13:59:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:45,879 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-22 13:59:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 13:59:45,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-22 13:59:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:45,881 INFO L225 Difference]: With dead ends: 59 [2019-11-22 13:59:45,882 INFO L226 Difference]: Without dead ends: 59 [2019-11-22 13:59:45,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-22 13:59:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-22 13:59:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-11-22 13:59:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-22 13:59:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-22 13:59:45,888 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-11-22 13:59:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:45,889 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-22 13:59:45,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-22 13:59:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-22 13:59:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 13:59:45,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:45,890 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:46,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:46,094 INFO L410 AbstractCegarLoop]: === Iteration 10 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-11-22 13:59:46,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:46,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724078387] [2019-11-22 13:59:46,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:46,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724078387] [2019-11-22 13:59:46,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802755652] [2019-11-22 13:59:46,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:46,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 13:59:46,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:46,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:46,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:46,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:46,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:59:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:49,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:49,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-22 13:59:49,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516757726] [2019-11-22 13:59:49,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-22 13:59:49,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-22 13:59:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-22 13:59:49,117 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-11-22 13:59:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:50,880 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-22 13:59:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 13:59:50,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-22 13:59:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:50,881 INFO L225 Difference]: With dead ends: 58 [2019-11-22 13:59:50,882 INFO L226 Difference]: Without dead ends: 58 [2019-11-22 13:59:50,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-22 13:59:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-22 13:59:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-22 13:59:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 13:59:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-22 13:59:50,887 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-11-22 13:59:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:50,888 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-22 13:59:50,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-22 13:59:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-22 13:59:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-22 13:59:50,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:50,889 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, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:51,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:51,097 INFO L410 AbstractCegarLoop]: === Iteration 11 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-11-22 13:59:51,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:51,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269065429] [2019-11-22 13:59:51,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 13:59:51,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269065429] [2019-11-22 13:59:51,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452627631] [2019-11-22 13:59:51,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:51,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-22 13:59:51,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:51,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:51,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:51,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:51,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:51,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:52,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:52,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-22 13:59:52,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173864550] [2019-11-22 13:59:52,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 13:59:52,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:52,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 13:59:52,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-22 13:59:52,009 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-11-22 13:59:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:52,490 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-22 13:59:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 13:59:52,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-22 13:59:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:52,492 INFO L225 Difference]: With dead ends: 56 [2019-11-22 13:59:52,492 INFO L226 Difference]: Without dead ends: 56 [2019-11-22 13:59:52,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-22 13:59:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-22 13:59:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-22 13:59:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 13:59:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-22 13:59:52,497 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-11-22 13:59:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:52,498 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-22 13:59:52,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 13:59:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-22 13:59:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 13:59:52,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:52,500 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:52,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:52,701 INFO L410 AbstractCegarLoop]: === Iteration 12 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-11-22 13:59:52,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:52,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069011056] [2019-11-22 13:59:52,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 13:59:52,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069011056] [2019-11-22 13:59:52,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018164543] [2019-11-22 13:59:52,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:52,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-22 13:59:52,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:52,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-22 13:59:52,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:52,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:52,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:59:52,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-22 13:59:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:53,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:53,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-22 13:59:53,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388024092] [2019-11-22 13:59:53,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 13:59:53,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 13:59:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-22 13:59:53,451 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-11-22 13:59:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:53,927 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-22 13:59:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 13:59:53,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-22 13:59:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:53,934 INFO L225 Difference]: With dead ends: 55 [2019-11-22 13:59:53,934 INFO L226 Difference]: Without dead ends: 55 [2019-11-22 13:59:53,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-22 13:59:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-22 13:59:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-22 13:59:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-22 13:59:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-22 13:59:53,938 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-11-22 13:59:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:53,939 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-22 13:59:53,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 13:59:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-22 13:59:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 13:59:53,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:53,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:54,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:54,145 INFO L410 AbstractCegarLoop]: === Iteration 13 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-11-22 13:59:54,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:54,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105170799] [2019-11-22 13:59:54,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:59:54,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105170799] [2019-11-22 13:59:54,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:54,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:54,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875573510] [2019-11-22 13:59:54,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:54,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:54,217 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-11-22 13:59:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:54,373 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-22 13:59:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:59:54,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-22 13:59:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:54,375 INFO L225 Difference]: With dead ends: 52 [2019-11-22 13:59:54,375 INFO L226 Difference]: Without dead ends: 52 [2019-11-22 13:59:54,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:59:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-22 13:59:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-22 13:59:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-22 13:59:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-22 13:59:54,378 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-11-22 13:59:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:54,378 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-22 13:59:54,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-22 13:59:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-22 13:59:54,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:54,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:54,380 INFO L410 AbstractCegarLoop]: === Iteration 14 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-22 13:59:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-11-22 13:59:54,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:54,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21902724] [2019-11-22 13:59:54,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-22 13:59:54,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21902724] [2019-11-22 13:59:54,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:54,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:59:54,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638523518] [2019-11-22 13:59:54,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:59:54,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:59:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:54,487 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-11-22 13:59:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:54,658 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-22 13:59:54,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:54,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-22 13:59:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:54,659 INFO L225 Difference]: With dead ends: 51 [2019-11-22 13:59:54,659 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 13:59:54,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-22 13:59:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 13:59:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 13:59:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 13:59:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 13:59:54,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-22 13:59:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:54,660 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 13:59:54,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:59:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 13:59:54,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 13:59:54,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:59:54 BoogieIcfgContainer [2019-11-22 13:59:54,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 13:59:54,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 13:59:54,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 13:59:54,667 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 13:59:54,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:29" (3/4) ... [2019-11-22 13:59:54,670 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 13:59:54,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 13:59:54,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-11-22 13:59:54,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 13:59:54,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 13:59:54,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-22 13:59:54,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 13:59:54,685 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-22 13:59:54,686 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 13:59:54,686 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 13:59:54,687 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 13:59:54,741 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 13:59:54,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 13:59:54,743 INFO L168 Benchmark]: Toolchain (without parser) took 25691.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -207.9 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:54,743 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:54,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:54,745 INFO L168 Benchmark]: Boogie Preprocessor took 45.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:54,745 INFO L168 Benchmark]: RCFGBuilder took 482.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:54,746 INFO L168 Benchmark]: TraceAbstraction took 24727.07 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:54,746 INFO L168 Benchmark]: Witness Printer took 74.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:54,749 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 482.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24727.07 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 63 locations, 16 error locations. Result: SAFE, OverallTime: 24.6s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 436 SDtfs, 1574 SDslu, 736 SDs, 0 SdLazy, 4297 SolverSat, 442 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 546 ConstructedInterpolants, 78 QuantifiedInterpolants, 132425 SizeOfPredicates, 68 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 25/49 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...