./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc 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-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:58:15,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:58:15,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:58:15,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:58:15,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:58:15,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:58:15,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:58:15,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:58:15,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:58:15,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:58:15,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:58:15,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:58:15,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:58:15,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:58:15,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:58:15,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:58:15,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:58:15,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:58:15,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:58:15,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:58:15,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:58:15,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:58:15,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:58:15,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:58:15,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:58:15,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:58:15,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:58:15,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:58:15,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:58:15,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:58:15,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:58:15,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:58:15,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:58:15,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:58:15,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:58:15,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:58:15,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:58:15,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:58:15,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:58:15,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:58:15,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:58:15,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 17:58:15,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:58:15,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:58:15,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:58:15,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:58:15,603 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:58:15,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:58:15,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:58:15,604 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:58:15,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:58:15,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:58:15,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:58:15,607 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:58:15,607 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:58:15,607 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:58:15,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:58:15,608 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:58:15,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:58:15,609 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:58:15,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:58:15,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:58:15,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:58:15,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:58:15,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:15,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:58:15,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:58:15,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:58:15,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:58:15,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-11-25 17:58:15,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:58:15,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:58:15,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:58:15,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:58:15,916 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:58:15,917 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2019-11-25 17:58:15,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851fb9d3f/771239a9fa544233816a38282adfbf5b/FLAG3813330cd [2019-11-25 17:58:16,431 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:58:16,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2019-11-25 17:58:16,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851fb9d3f/771239a9fa544233816a38282adfbf5b/FLAG3813330cd [2019-11-25 17:58:16,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851fb9d3f/771239a9fa544233816a38282adfbf5b [2019-11-25 17:58:16,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:58:16,813 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:58:16,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:16,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:58:16,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:58:16,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:16" (1/1) ... [2019-11-25 17:58:16,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f9614c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:16, skipping insertion in model container [2019-11-25 17:58:16,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:16" (1/1) ... [2019-11-25 17:58:16,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:58:16,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:58:17,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:17,027 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:58:17,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:58:17,122 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:58:17,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17 WrapperNode [2019-11-25 17:58:17,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:58:17,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:58:17,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:58:17,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:58:17,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... [2019-11-25 17:58:17,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:58:17,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:58:17,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:58:17,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:58:17,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:58:17,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:58:17,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:58:17,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:58:17,255 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-11-25 17:58:17,256 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-25 17:58:17,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:58:17,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:58:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:58:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:58:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:58:17,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:58:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:58:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:58:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-11-25 17:58:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:58:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-25 17:58:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:58:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:58:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:58:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:58:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:58:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:58:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:58:17,663 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:58:17,663 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 17:58:17,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:17 BoogieIcfgContainer [2019-11-25 17:58:17,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:58:17,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:58:17,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:58:17,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:58:17,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:58:16" (1/3) ... [2019-11-25 17:58:17,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca54554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:17, skipping insertion in model container [2019-11-25 17:58:17,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:17" (2/3) ... [2019-11-25 17:58:17,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca54554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:17, skipping insertion in model container [2019-11-25 17:58:17,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:17" (3/3) ... [2019-11-25 17:58:17,675 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-11-25 17:58:17,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:58:17,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 17:58:17,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 17:58:17,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:58:17,725 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:58:17,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:58:17,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:58:17,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:58:17,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:58:17,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:58:17,726 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:58:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-25 17:58:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:58:17,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:17,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:17,755 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-25 17:58:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-11-25 17:58:17,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:17,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158595956] [2019-11-25 17:58:17,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:18,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158595956] [2019-11-25 17:58:18,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:18,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:58:18,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009243123] [2019-11-25 17:58:18,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:18,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:18,133 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-11-25 17:58:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:18,606 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-25 17:58:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:58:18,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-25 17:58:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:18,627 INFO L225 Difference]: With dead ends: 60 [2019-11-25 17:58:18,628 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 17:58:18,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:58:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 17:58:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 17:58:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 17:58:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-25 17:58:18,667 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-11-25 17:58:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:18,668 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-25 17:58:18,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-25 17:58:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:58:18,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:18,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:18,670 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-25 17:58:18,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:18,670 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-11-25 17:58:18,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:18,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647923636] [2019-11-25 17:58:18,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:18,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647923636] [2019-11-25 17:58:18,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:18,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:58:18,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127080947] [2019-11-25 17:58:18,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:58:18,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:58:18,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:18,910 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-11-25 17:58:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:19,545 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-25 17:58:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:58:19,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-25 17:58:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:19,549 INFO L225 Difference]: With dead ends: 70 [2019-11-25 17:58:19,550 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 17:58:19,551 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-25 17:58:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 17:58:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-25 17:58:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 17:58:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-25 17:58:19,561 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-25 17:58:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:19,562 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-25 17:58:19,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:58:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-25 17:58:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:58:19,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:19,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:19,564 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-25 17:58:19,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:19,564 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-11-25 17:58:19,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:19,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362838411] [2019-11-25 17:58:19,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:19,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362838411] [2019-11-25 17:58:19,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:19,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:58:19,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145298706] [2019-11-25 17:58:19,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:58:19,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:58:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:58:19,776 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-11-25 17:58:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:20,342 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-25 17:58:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:58:20,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 17:58:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:20,344 INFO L225 Difference]: With dead ends: 69 [2019-11-25 17:58:20,344 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 17:58:20,345 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-25 17:58:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 17:58:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-25 17:58:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:58:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 17:58:20,353 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-11-25 17:58:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:20,353 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 17:58:20,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:58:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 17:58:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:58:20,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:20,355 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-25 17:58:20,355 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-25 17:58:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-11-25 17:58:20,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:20,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340209569] [2019-11-25 17:58:20,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:20,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340209569] [2019-11-25 17:58:20,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:20,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:58:20,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250542492] [2019-11-25 17:58:20,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:58:20,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:20,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:58:20,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:58:20,435 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-25 17:58:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:20,603 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-25 17:58:20,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:58:20,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 17:58:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:20,605 INFO L225 Difference]: With dead ends: 61 [2019-11-25 17:58:20,605 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 17:58:20,606 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-25 17:58:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 17:58:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-25 17:58:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 17:58:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-25 17:58:20,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-11-25 17:58:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:20,613 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-25 17:58:20,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:58:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-25 17:58:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:58:20,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:20,615 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-25 17:58:20,615 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-25 17:58:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-11-25 17:58:20,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:20,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356297269] [2019-11-25 17:58:20,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,875 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-25 17:58:20,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356297269] [2019-11-25 17:58:20,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930816001] [2019-11-25 17:58:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:20,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 17:58:20,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:21,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:58:21,033 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:21,038 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:21,038 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:21,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:21,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:21,303 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-25 17:58:21,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:21,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-25 17:58:21,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775532652] [2019-11-25 17:58:21,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 17:58:21,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:21,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 17:58:21,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:58:21,305 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-11-25 17:58:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:22,159 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-25 17:58:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:58:22,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-25 17:58:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:22,161 INFO L225 Difference]: With dead ends: 69 [2019-11-25 17:58:22,161 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 17:58:22,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-25 17:58:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 17:58:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-25 17:58:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:58:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-25 17:58:22,168 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-11-25 17:58:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:22,168 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-25 17:58:22,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 17:58:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-25 17:58:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:58:22,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:22,169 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-25 17:58:22,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:22,375 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-25 17:58:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-11-25 17:58:22,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:22,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846773865] [2019-11-25 17:58:22,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:58:22,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846773865] [2019-11-25 17:58:22,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:22,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 17:58:22,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183513243] [2019-11-25 17:58:22,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:58:22,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:22,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:58:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:58:22,532 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-11-25 17:58:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:22,864 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-25 17:58:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:58:22,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-25 17:58:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:22,867 INFO L225 Difference]: With dead ends: 69 [2019-11-25 17:58:22,867 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 17:58:22,867 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-25 17:58:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 17:58:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-25 17:58:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:58:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-25 17:58:22,872 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-11-25 17:58:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:22,873 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-25 17:58:22,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:58:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-25 17:58:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:58:22,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:22,874 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-25 17:58:22,874 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-25 17:58:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-11-25 17:58:22,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:22,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426020640] [2019-11-25 17:58:22,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:23,044 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-25 17:58:23,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426020640] [2019-11-25 17:58:23,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589908557] [2019-11-25 17:58:23,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:23,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 17:58:23,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:23,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:58:23,102 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:23,107 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:23,108 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:23,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:23,354 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-25 17:58:23,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:23,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-25 17:58:23,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954228140] [2019-11-25 17:58:23,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 17:58:23,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:23,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 17:58:23,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:58:23,356 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-11-25 17:58:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:24,245 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 17:58:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 17:58:24,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-25 17:58:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:24,248 INFO L225 Difference]: With dead ends: 64 [2019-11-25 17:58:24,248 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 17:58:24,249 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-25 17:58:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 17:58:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-25 17:58:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 17:58:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-25 17:58:24,255 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-11-25 17:58:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:24,255 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-25 17:58:24,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 17:58:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-25 17:58:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 17:58:24,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:24,256 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-25 17:58:24,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:24,460 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-25 17:58:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-11-25 17:58:24,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:24,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186220384] [2019-11-25 17:58:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,555 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-25 17:58:24,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186220384] [2019-11-25 17:58:24,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:24,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:58:24,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776992111] [2019-11-25 17:58:24,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:58:24,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:58:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:58:24,559 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-11-25 17:58:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:24,815 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-25 17:58:24,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:58:24,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-25 17:58:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:24,817 INFO L225 Difference]: With dead ends: 57 [2019-11-25 17:58:24,817 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 17:58:24,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:58:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 17:58:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 17:58:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 17:58:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-25 17:58:24,822 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-11-25 17:58:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:24,822 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-25 17:58:24,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:58:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-25 17:58:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 17:58:24,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:24,823 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-25 17:58:24,824 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-25 17:58:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-11-25 17:58:24,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:24,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672498718] [2019-11-25 17:58:24,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:25,113 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-25 17:58:25,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672498718] [2019-11-25 17:58:25,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099956058] [2019-11-25 17:58:25,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:25,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:58:25,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:25,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:58:25,187 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:25,194 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:25,194 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:25,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:25,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:25,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:27,744 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-25 17:58:27,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:27,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-25 17:58:27,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495304231] [2019-11-25 17:58:27,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-25 17:58:27,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-25 17:58:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-25 17:58:27,747 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-11-25 17:58:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:31,784 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-11-25 17:58:31,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:58:31,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-25 17:58:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:31,787 INFO L225 Difference]: With dead ends: 61 [2019-11-25 17:58:31,787 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 17:58:31,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-25 17:58:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 17:58:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2019-11-25 17:58:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 17:58:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-25 17:58:31,794 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-11-25 17:58:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:31,794 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-25 17:58:31,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-25 17:58:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-25 17:58:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 17:58:31,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:31,796 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:58:31,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:32,000 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-25 17:58:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-11-25 17:58:32,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:32,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199561609] [2019-11-25 17:58:32,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:32,306 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-25 17:58:32,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199561609] [2019-11-25 17:58:32,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787412150] [2019-11-25 17:58:32,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:32,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:58:32,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:32,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:58:32,368 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:32,373 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:32,373 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:32,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:58:34,805 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-25 17:58:34,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:58:34,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-25 17:58:34,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207121316] [2019-11-25 17:58:34,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-25 17:58:34,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-25 17:58:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-25 17:58:34,807 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-11-25 17:58:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:36,434 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-25 17:58:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:58:36,434 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-25 17:58:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:36,435 INFO L225 Difference]: With dead ends: 58 [2019-11-25 17:58:36,436 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 17:58:36,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-25 17:58:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 17:58:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-25 17:58:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 17:58:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-25 17:58:36,441 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-11-25 17:58:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:36,442 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-25 17:58:36,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-25 17:58:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-25 17:58:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 17:58:36,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:36,443 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-25 17:58:36,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:36,647 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-25 17:58:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-11-25 17:58:36,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:36,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316572401] [2019-11-25 17:58:36,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,821 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-25 17:58:36,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316572401] [2019-11-25 17:58:36,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129282783] [2019-11-25 17:58:36,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:36,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 17:58:36,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:36,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:58:36,881 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:36,885 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:36,886 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:36,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:37,314 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-25 17:58:37,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:58:37,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-25 17:58:37,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055287460] [2019-11-25 17:58:37,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:58:37,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:58:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:58:37,317 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-11-25 17:58:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:37,793 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-25 17:58:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:58:37,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-25 17:58:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:37,794 INFO L225 Difference]: With dead ends: 56 [2019-11-25 17:58:37,794 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 17:58:37,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:58:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 17:58:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-25 17:58:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 17:58:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-25 17:58:37,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-11-25 17:58:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:37,800 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-25 17:58:37,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:58:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-25 17:58:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 17:58:37,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:37,802 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-25 17:58:38,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:38,012 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-25 17:58:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-11-25 17:58:38,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:38,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201614964] [2019-11-25 17:58:38,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,184 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-25 17:58:38,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201614964] [2019-11-25 17:58:38,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825750475] [2019-11-25 17:58:38,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:38,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 17:58:38,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:58:38,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 17:58:38,270 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:58:38,277 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:58:38,277 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:58:38,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-25 17:58:38,759 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-25 17:58:38,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:58:38,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-25 17:58:38,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638238] [2019-11-25 17:58:38,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:58:38,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:58:38,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:58:38,761 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-11-25 17:58:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:39,214 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-25 17:58:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:58:39,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-25 17:58:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:39,216 INFO L225 Difference]: With dead ends: 55 [2019-11-25 17:58:39,216 INFO L226 Difference]: Without dead ends: 55 [2019-11-25 17:58:39,217 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-25 17:58:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-25 17:58:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-25 17:58:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 17:58:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-25 17:58:39,222 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-11-25 17:58:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:39,223 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-25 17:58:39,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:58:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-25 17:58:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 17:58:39,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:39,224 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-25 17:58:39,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:58:39,428 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-25 17:58:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-11-25 17:58:39,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:39,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309340043] [2019-11-25 17:58:39,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,493 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-25 17:58:39,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309340043] [2019-11-25 17:58:39,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:39,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:58:39,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859649195] [2019-11-25 17:58:39,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:58:39,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:58:39,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:58:39,495 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-11-25 17:58:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:39,648 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-25 17:58:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:58:39,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-25 17:58:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:39,649 INFO L225 Difference]: With dead ends: 52 [2019-11-25 17:58:39,650 INFO L226 Difference]: Without dead ends: 52 [2019-11-25 17:58:39,650 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-25 17:58:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-25 17:58:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-25 17:58:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 17:58:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-25 17:58:39,656 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-11-25 17:58:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:39,658 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-25 17:58:39,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:58:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-25 17:58:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 17:58:39,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:58:39,662 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-25 17:58:39,663 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-25 17:58:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:58:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-11-25 17:58:39,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:58:39,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323374978] [2019-11-25 17:58:39,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:58:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:58:39,812 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-25 17:58:39,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323374978] [2019-11-25 17:58:39,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:58:39,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:58:39,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433710926] [2019-11-25 17:58:39,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:58:39,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:58:39,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:58:39,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:58:39,815 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-11-25 17:58:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:58:39,986 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-25 17:58:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:58:39,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-25 17:58:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:58:39,987 INFO L225 Difference]: With dead ends: 51 [2019-11-25 17:58:39,987 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:58:39,988 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-25 17:58:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:58:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:58:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:58:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:58:39,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-25 17:58:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:58:39,989 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:58:39,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:58:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:58:39,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:58:39,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:39 BoogieIcfgContainer [2019-11-25 17:58:39,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:58:39,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:58:39,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:58:39,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:58:39,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:17" (3/4) ... [2019-11-25 17:58:39,997 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:58:40,002 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:58:40,003 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-11-25 17:58:40,003 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:58:40,003 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:58:40,003 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-25 17:58:40,003 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:58:40,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-25 17:58:40,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 17:58:40,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 17:58:40,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:58:40,058 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:58:40,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:58:40,059 INFO L168 Benchmark]: Toolchain (without parser) took 23246.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:40,060 INFO L168 Benchmark]: CDTParser took 0.27 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-25 17:58:40,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:40,060 INFO L168 Benchmark]: Boogie Preprocessor took 60.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:40,061 INFO L168 Benchmark]: RCFGBuilder took 479.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:40,061 INFO L168 Benchmark]: TraceAbstraction took 22328.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:58:40,062 INFO L168 Benchmark]: Witness Printer took 63.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:58:40,064 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.27 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 310.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 479.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22328.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 249.5 MB. Max. memory is 11.5 GB. * Witness Printer took 63.76 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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: 22.2s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 434 SDtfs, 1604 SDslu, 754 SDs, 0 SdLazy, 4253 SolverSat, 447 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 10.9s 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 44 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s 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...